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 991–1020 of 3276 results
- DoorDashMediumSoftware EngineerDetermine equality after limited swaps
This question evaluates string manipulation and combinatorial reasoning about character swaps and anagram formation, focusing on competencies such as frequency analysis and reasoning about minimal edit operations.
Coding & AlgorithmsTechnical Screen - DoorDashMediumSoftware EngineerFind Each Cell's Nearest Source
This question evaluates understanding of shortest-path computation and distance labeling in grid-based graphs, measuring competency in algorithmic problem solving and efficient traversal strategies.
Coding & AlgorithmsOnsite - DoorDashMediumMachine Learning EngineerFind closest value to a target in a BST
This question evaluates understanding of binary search tree properties and numeric approximation, measuring competence in tree traversal, comparison logic, and algorithmic efficiency under input-size constraints.
Coding & AlgorithmsOnsite - DoorDashHardSoftware EngineerFind longest common ordered restaurant list
This question evaluates a candidate's understanding of sequence algorithms, dynamic programming, and string/list manipulation by requiring computation of the longest common subsequence between two ordered lists of restaurant IDs.
Coding & AlgorithmsOnsite - DoorDashMediumSoftware EngineerFind names similar by one swap
This question evaluates string manipulation, character-frequency analysis, and algorithmic reasoning to determine near-matches under a single-character-swap constraint.
Coding & AlgorithmsTechnical Screen - DoorDashMediumSoftware EngineerFind the Minimum Delivery Processing Speed
This problem tests binary search on the answer space to find the minimum throughput capacity required to process a set of delivery orders within a fixed deadline.
Coding & AlgorithmsOnsiteBinary SearchOptimizationMath - DoorDashMediumSoftware EngineerFind the Minimum Parenthesis Deletions and Their Positions
This problem tests string manipulation, stack-based parsing, and greedy logic to identify the indices of parentheses that must be removed to transform a string into a valid sequence.
Coding & AlgorithmsOnsiteStringsStackGreedy - DoorDashMediumSoftware EngineerGenerate the next lexicographic array arrangement
This interview question evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer for Generate the next lexicographic array arrangement states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.
Coding & AlgorithmsOnsite - DoorDashMediumSoftware EngineerIdentify members lacking specialty coverage
Identify members lacking specialty coverage evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.
Coding & AlgorithmsOnsite - DoorDashMediumSoftware EngineerImplement Timeout Refund Workflow
Design and implement a stateful, idempotent refund workflow manager that safely handles gateway timeouts, retries, and duplicate requests.
Coding & AlgorithmsOnsiteState MachineIdempotencySystem Design - DoorDashEasySoftware EngineerImplement a consistent hashing ring
This question evaluates understanding of consistent hashing, virtual nodes, deterministic hash functions, and data structure design for efficient key-to-server mapping and dynamic membership changes.
Coding & AlgorithmsOnsite - DoorDashMediumSoftware EngineerImplement a hierarchical key-value store
Implement a hierarchical key-value store evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.
Coding & AlgorithmsTechnical Screen - DoorDashMediumSoftware EngineerImplement a simple service with tests
Implement a simple service with tests evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.
Coding & AlgorithmsOnsite - DoorDashMediumSoftware EngineerImplement and compare round-robin and consistent hashing
This question evaluates a candidate's ability to implement and reason about load balancing algorithms (round-robin and consistent hashing), covering competencies in data structures, hashing, concurrency, correctness, and unit testing.
Coding & AlgorithmsOnsite - DoorDashMediumSoftware EngineerImplement consistent hashing ring
This interview question evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer for Implement consistent hashing ring states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.
Coding & AlgorithmsTechnical Screen - DoorDashMediumSoftware EngineerImplement dasher active-time calculator
This question evaluates competency in time-based event processing, pairing related events, computing durations using LocalDateTime and Duration APIs, and analyzing algorithmic time and space complexity.
Coding & AlgorithmsTechnical Screen - DoorDashMediumSoftware EngineerImplement image carousel with comments and upvotes
This question evaluates a candidate's ability to design scalable data structures and efficient algorithms for interactive features, including API design, pagination, and consistency/concurrency handling for upvotes and per-image comment threads.
Coding & AlgorithmsOnsite - DoorDashMediumSoftware EngineerImplement round-robin load balancer
This question evaluates a candidate's ability to implement a strict round-robin load balancer with O(1) average operations while handling concurrent nextServer and update calls, health-check-driven skipping, and failure scenarios, testing competencies in data structures, concurrent programming, and fault-tolerant system behavior.
Coding & AlgorithmsOnsite - DoorDashMediumSoftware EngineerImplement string matching with follow-up
A DoorDash software-engineer coding screen on string matching: implement firstIndex(T, P) in O(|T| + |P|) time and O(|P|) space using KMP, then handle follow-ups on naive vs KMP vs Rabin–Karp, Unicode and very long inputs, edge cases, wildcard ('?'/'*') matching, and simultaneous multi-pattern search via Aho–Corasick. Includes corrected, complete solutions and complexity trade-offs.
Coding & AlgorithmsTechnical Screen - DoorDashMediumSoftware EngineerImplement string-path file system operations
This question evaluates competency in designing data structures for hierarchical string-path file systems, including string parsing, stateful API semantics, validation logic, and efficient lookup/update operations.
Coding & AlgorithmsTechnical Screen - DoorDashMediumMachine Learning EngineerMinimize batches and allocate riders by time
This problem tests your ability to optimize resource scheduling by grouping tasks with overlapping time windows into the minimum number of batches, subject to capacity constraints.
Coding & AlgorithmsTechnical ScreenGreedyIntervalsBin Packing - DoorDashMediumSoftware EngineerPooled Rideshare Earnings With Concurrent Rides and Surge
Compute a pooled-ride driver's total earnings where each minute's pay scales with how many riders are currently in the car, and minutes inside non-overlapping surge windows pay double, testing sweep-line interval counting with exact half-open boundaries and 64-bit totals.
Coding & AlgorithmsTechnical Screensweep-lineintervalsarrays - DoorDashMediumSoftware EngineerSelect the best dasher for an order
This problem evaluates algorithmic selection and geometric computation skills—filtering eligible dashers, calculating Euclidean distances, and applying deterministic tie-breaking—within the Coding & Algorithms domain at an implementation-level algorithmic abstraction.
Coding & AlgorithmsOnline Assessment - DoorDashMediumSoftware EngineerSimulate Constant-Time Random Courier Selection
Design a courier pool data structure that supports adding, removing, and uniformly selecting random courier IDs in average O(1) time.
Coding & AlgorithmsTechnical ScreenData StructuresHash TableArray - DoorDashMediumSoftware EngineerSolve BFS grid delivery routing
This question evaluates proficiency in grid-based graph traversal and shortest-path computation, along with complexity analysis and handling dynamic changes, assessing skills in algorithm design, graph algorithms, and data structures within the Coding & Algorithms domain.
Coding & AlgorithmsTechnical Screen - DoorDashMediumSoftware EngineerSolve string match and DashMart BFS
This question evaluates proficiency with string algorithms and pattern matching, assessing understanding of substring search complexity and algorithm selection within the algorithms and data structures domain, and is commonly asked to verify efficient low-level text-search implementation and time/space trade-off reasoning at a practical implementation level. The "Dash Mart" grid BFS evaluates graph traversal, state-space modeling, and shortest-path reasoning for multi-target collection tasks within graph algorithms and path-finding, and is commonly asked to measure competence in BFS-based search, state encoding and optimization strategies with a focus on practical algorithmic application and performance considerations.
Coding & AlgorithmsTechnical Screen - DoorDashMediumSoftware EngineerSolve tree distance and design file system
This interview question evaluates algorithm design, data structures, correctness, complexity, edge cases, and implementation details in a realistic interview setting. A strong answer for Solve tree distance and design file system states assumptions, handles edge cases, explains trade-offs, and shows how to validate the result clearly.
Coding & AlgorithmsOnsite - DoorDashMediumSoftware EngineerTrack the First Unique Restaurant in a Stream
This problem tests your ability to maintain stream uniqueness using a combination of a hash map and a doubly linked list to ensure constant-time operations.
Coding & AlgorithmsOnsiteHash MapLinked ListDesign - DoorDashMediumSoftware EngineerValidate a Shopping Cart
Implement a shopping cart validation function that checks item availability, consolidates duplicate entries, verifies inventory levels, and ensures order minimums are satisfied.
Coding & AlgorithmsTechnical ScreenHash TableData ValidationBusiness Logic - DropboxMediumData ScientistCompute max island with constrained flips
This question evaluates understanding of grid-based graph connectivity, connected-component labeling, and algorithmic complexity analysis (time and space) within the Coding & Algorithms domain, emphasizing practical algorithm design for large-scale inputs.
Coding & AlgorithmsTechnical Screen
DoorDash
Dropbox