practice a little every day, paws crossed ♡
Coding & Algorithms Interview Questions
Practice 9403 coding, system design and machine learning questions from 546 companies, sorted by role, topic and interview round. Every question has step-by-step hints, a code runner that supports 8 languages and an AI mentor; members also get the full solution walkthrough.
- 9403
- Questions
- 546
- Companies
- 11
- Topics
- 8
- Languages
Showing 271–300 of 1706 results
- AtlassianEasySoftware EngineerPer-Caller Request Limiter Over Non-Decreasing Time Buckets
A coding question about a rate limiter that receives requests as time bucket and caller pairs, in non-decreasing bucket order, and decides which to allow when each caller may make only a fixed number of requests per bucket. It tests stateful counting, per-key bookkeeping and correct handling of bucket changes.
Coding & AlgorithmsTechnical Screen - AttentiveMediumSoftware EngineerFind Inclusive Index Ranges for Time-Window Queries on Timestamp-Sorted Logs
Given log timestamps sorted in non-decreasing order with possible duplicates, answer many inclusive time-window queries by returning the first and last index of the entries inside each window, where a window may extend past the data's time range. It tests O(log n) per-query boundary searches on sorted data with duplicate keys.
Coding & AlgorithmsTechnical Screen - AttentiveMediumSoftware EngineerRemove Adjacent Duplicate Runs of Length K
Implement a linear-time string reduction algorithm that repeatedly eliminates adjacent runs of k identical characters using a stack.
Coding & AlgorithmsTechnical Screenstackstringalgorithms - AuroraMediumSoftware EngineerCompute streaming sliding-window minimums
This question evaluates a candidate's understanding of streaming algorithms and efficient data-structure techniques for maintaining sliding-window minima, measuring competency in algorithmic thinking, time and space complexity, and online processing.
Coding & AlgorithmsTechnical Screen - AuroraMediumSoftware EngineerEvaluate an Arithmetic Expression
Evaluate arithmetic expressions containing non-negative integers and the four basic operators without using eval. Preserve precedence and left associativity, implement division that truncates toward zero, and process expressions up to 300,000 characters efficiently.
Coding & AlgorithmsTechnical Screen - AuroraHardSoftware EngineerImplement a reference-counted smart pointer
This question evaluates understanding of C++ resource management, ownership semantics, RAII, and reference counting implementation within the coding and algorithms domain, emphasizing pointer semantics and object lifetime.
Coding & AlgorithmsTechnical Screen - BCGMediumForward Deploy EngineerShortest Distance in an Unweighted Adjacency-Matrix Graph
This problem tests implementing breadth-first search (BFS) on an unweighted, undirected graph represented as an adjacency matrix to find the shortest path distance between two vertices.
Coding & AlgorithmsTechnical ScreenGraphBFSShortest Path - BasetenMediumSoftware EngineerParallelize chunked file download and verify integrity
This problem tests your ability to implement a concurrent file downloader that fetches file segments in parallel, handles partial failures with retries, and verifies overall data integrity using a checksum.
Coding & AlgorithmsTechnical ScreenConcurrencyI/OHashing - BeaconfireEasyMachine Learning EngineerCheck Whether a String Is Built by Repetition
This problem tests your ability to detect periodic string patterns using string manipulation or mathematical properties, specifically focusing on efficient substring identification.
Coding & AlgorithmsTechnical ScreenStringsPattern MatchingAlgorithms - Bilt RewardsMediumSoftware EngineerDebug and Fix Failing Unit Tests in Java
This question evaluates proficiency in debugging and maintaining a Java codebase with failing unit tests, testing competencies in unit testing, fault isolation, reading test assertions and stack traces, and verifying regression-free fixes.
Coding & AlgorithmsTechnical Screen - BitGoMediumSoftware EngineerSolve and extend the Knapsack problem
This question evaluates a candidate's understanding of dynamic programming for optimization problems, specifically the 0/1 knapsack formulation, space-optimized DP and the ability to reconstruct a chosen item set from compressed state.
Coding & AlgorithmsTechnical Screen - BlackRockEasySoftware EngineerDesign paint editor with undo/redo
This question evaluates a candidate's ability to implement mutable state management, efficient data structures and algorithms for pixel operations (draw, erase, flood fill) alongside correct undo/redo history tracking and state consistency.
Coding & AlgorithmsTechnical Screen - BlackRockMediumData EngineerSolve two interval array problems
This question evaluates proficiency with array and interval-manipulation concepts—specifically sorting, merging overlapping ranges, and robust edge-case handling in interval operations.
Coding & AlgorithmsTechnical Screen - Block (Square)MediumData ScientistBuild referral chains and detect cycles
This question evaluates graph algorithm competencies such as referral-chain traversal, cycle detection, handling noisy input data, and reasoning about time and space complexity for efficient per-node computation.
Coding & AlgorithmsTechnical Screen - BloombergMediumSoftware EngineerAdd Two Forward-Order Lists
This problem tests your ability to perform manual addition on numbers represented by linked lists where the most significant digit comes first, requiring either stack-based reversal or recursive backtracking.
Coding & AlgorithmsTechnical ScreenLinked ListMathStack - BloombergMediumSoftware EngineerCheck equal character frequencies
This problem tests your ability to use frequency mapping to determine if a string can be transformed into a state where all characters appear the same number of times through a single character removal.
Coding & AlgorithmsTechnical ScreenStringHash MapFrequency Analysis - BloombergEasySoftware EngineerCompute meeting rooms and evaluate RPN
This problem tests interval management using sorting and heap-like logic for resource allocation, combined with stack manipulation to evaluate mathematical expressions.
Coding & AlgorithmsTechnical ScreenSortingHeapStack - BloombergMediumSoftware EngineerCount friend requests based on age rules
This question evaluates algorithmic problem-solving skills involving array processing, counting and combinatorics under conditional constraints and frequency handling.
Coding & AlgorithmsTechnical Screen - BloombergMediumSoftware EngineerCount islands by requested sizes
This problem tests your ability to use graph traversal (DFS/BFS) to identify connected components in a grid and efficiently query their sizes using frequency maps.
Coding & AlgorithmsTechnical ScreenGraphsDFSGrid - BloombergHardSoftware EngineerDesign a data structure for dynamic top‑K frequency
This question evaluates data structure and algorithm design skills, focusing on frequency counting, dynamic maintenance of top-K elements, and efficient update and query operations in a multiset within the Coding & Algorithms domain.
Coding & AlgorithmsTechnical Screen - BloombergMediumSoftware EngineerDesign variable-size LRU cache
This question evaluates understanding of cache design and eviction policies (LRU), management of variable-sized entries and memory budgeting, and the implementation of efficient data structures that support amortized O(1) access, updates and correct capacity accounting.
Coding & AlgorithmsTechnical Screen - BloombergHardSoftware EngineerDetect Recent Duplicate Records with Bounded Memory
Design a memory-bounded streaming duplicate detector that identifies repeated news/document records within a sliding time window and evicts expired content to prevent memory leaks.
Coding & AlgorithmsTechnical ScreenSliding WindowHash TableQueue - BloombergMediumSoftware EngineerDetermine Balloon Popping Time
This problem tests your ability to model a grid-based propagation process as a shortest-path problem on a weighted graph, requiring an understanding of Dijkstra's algorithm or Breadth-First Search variants.
Coding & AlgorithmsTechnical ScreenGraphBFSShortest Path - BloombergMediumSoftware EngineerFind maximum cable length by cutting
This question evaluates a candidate's proficiency in algorithm design, particularly applying binary search over a monotonic answer space and managing integer versus floating-point precision when maximizing piece length.
Coding & AlgorithmsTechnical Screen - BloombergMediumSoftware EngineerFind the Lowest Common Ancestor of Two Nodes in an N-ary Tree
Given a rooted tree whose nodes can have any number of children, stored as child lists, return the lowest common ancestor of two labeled nodes. The problem generalizes the binary-tree version to arbitrary fan-out and tests tree traversal, ancestor reasoning, and robust handling of very deep, path-shaped trees.
Coding & AlgorithmsTechnical Screen - BloombergMediumSoftware EngineerFlag Fraudulent Transactions by Amount and Travel Time
This problem tests your ability to use hash maps for efficient lookups and filtering collections based on conditional business logic.
Coding & AlgorithmsTechnical ScreenHash MapsAlgorithmsData Structures - BloombergEasySoftware EngineerGenerate the Collatz Sequence From a Positive Integer Down to 1
Write a function that runs the Collatz process from a positive integer, halving even values and replacing odd values with three times the value plus one, and returns every number visited until reaching 1. It tests loop termination, edge cases such as a start of 1, and intermediate values beyond 32-bit range.
Coding & AlgorithmsTechnical Screen - BloombergMediumSoftware EngineerImplement a simplified grep with extensible flags
This question evaluates competency in designing maintainable, extensible text-processing code, covering flag parsing, separation of concerns, and correct substring matching behavior.
Coding & AlgorithmsTechnical Screen - BloombergMediumSoftware EngineerImplement classes in existing abstract hierarchy
This question evaluates object-oriented design and implementation skills in Python within the Coding & Algorithms and software engineering domain, focusing on completing concrete subclasses in an existing abstract class hierarchy while preserving public interfaces and type compatibility.
Coding & AlgorithmsTechnical Screen - BloombergMediumData EngineerImplement classes within an abstract Python framework
This question evaluates a candidate's skills in object-oriented design, implementing concrete classes from abstract interfaces, file I/O and streaming data transformations, error handling, and integration with a registry and CLI within a Python codebase.
Coding & AlgorithmsTechnical Screen
Atlassian
Attentive
Aurora
Baseten
Bloomberg