practice a little every day, paws crossed ♡
Software Engineer 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 1891–1920 of 5874 results
- DoorDashMediumSoftware EngineerBuild a Resilient Bootstrap API with Partial Upstream Results
Combine Consumer, Payment, and Address APIs with correct identifier dependencies, partial success, bounded timeouts, and complete response fields.
Software Engineering FundamentalsOnsite - DoorDashMediumSoftware EngineerBuild a Running Late-Order Refund Workflow as Separate Python Services
Build a continuously running Python system of separate services that executes a small workflow graph in which late orders trigger refunds, then discuss new features, API evolution, adding payments, and testing. It tests scoping under time pressure, service boundaries, idempotent refunds, and effective AI-assisted development.
Software Engineering FundamentalsOnsite - DoorDashMediumSoftware EngineerBuild a Three-Service Refund Workflow over HTTP
Implement and orchestrate a multi-service refund pipeline over HTTP, ensuring idempotent execution, safe concurrency limits, and crash recovery across separate process boundaries.
Software Engineering FundamentalsTechnical Screendistributed-systemshttp-apisidempotency - DoorDashMediumSoftware EngineerBuild an Order-Exception Microservice with Explicit Refund Policies
Design and demonstrate a local service for missing or delayed orders, with explicit refund rules, duplicate handling, and auditable decisions.
Software Engineering FundamentalsOnsite - DoorDashMediumSoftware EngineerBuild and Debug a Dasher-to-Order Assignment Service, Then Prepare It for Production
A DoorDash onsite exercise to finish and debug starter code for a service that assigns delivery drivers to orders. It tests constant-time bookkeeping, defending a list versus hash map storage choice, invariant-based testing, and how to make the service safe and scalable in production.
Software Engineering FundamentalsOnsite - DoorDashMediumSoftware EngineerCalculate Courier Earnings
This question evaluates algorithmic problem-solving with emphasis on temporal interval aggregation, handling overlapping events, and applying conditional rate multipliers under specified business rules.
Coding & AlgorithmsTechnical Screen - DoorDashHardSoftware EngineerCalculate Daily Driver Pay
This question evaluates event-driven time-interval processing, interval-overlap arithmetic, rate computation, and robustness to malformed, duplicate, or unordered events when aggregating a driver's pay from a day's log.
Coding & AlgorithmsTechnical Screen - DoorDashMediumSoftware EngineerCalculate Driver Payments
Implement a payout calculation system for delivery drivers by deduplicating order logs, merging overlapping active-time intervals, and computing base pay, delivery bonuses, and tips.
Coding & AlgorithmsOnsiteintervalssortinghash-table - DoorDashHardSoftware EngineerCompare front-end state management approaches
DoorDash software-engineer onsite front-end question: compare Redux with modern state and data management approaches (Redux Toolkit/RTK Query, React Query, SWR, Zustand, Recoil, MobX, Context) and design an end-to-end strategy for a React SPA that needs offline viewing, pagination, optimistic updates, and error retries. It tests separating client UI state from server cache, caching/invalidation, performance, type safety, testing, and an incremental migration plan off Redux.
Software Engineering FundamentalsOnsite - DoorDashEasySoftware EngineerCompute Courier Delivery Pay
This question tests the ability to handle time intervals and calculate cumulative earnings based on overlapping delivery pay rates.
Coding & AlgorithmsTechnical ScreenArraysIntervalsGreedy - DoorDashMediumSoftware EngineerCompute Differences Between Catalog Trees
This question evaluates proficiency in tree algorithms and hierarchical data comparison, including simultaneous traversal, subtree sizing, key-based node identity, and time/space complexity reasoning, and is commonly asked to assess algorithmic problem-solving and trade-off analysis when comparing structured datasets.
Coding & AlgorithmsTechnical Screen - DoorDashMediumSoftware EngineerCompute Driver Pay with Double-Pay Windows
This question evaluates a candidate's ability to perform interval arithmetic and aggregation for time-based pay computations, including handling overlapping intervals, half-open boundaries, capped double-pay application, and special-case handling for canceled orders.
Coding & AlgorithmsTechnical Screen - DoorDashEasySoftware EngineerCompute Nearest Destination Distances
This problem tests your ability to use Multi-Source Breadth-First Search (BFS) to find the distance from every empty cell to the nearest destination in a grid.
Coding & AlgorithmsTechnical ScreenBFSGraphsGrid - DoorDashMediumSoftware EngineerCompute cart total with best promotion
This question evaluates numerical reasoning for monetary calculations, handling of multiple promotion types, precision and rounding considerations, and edge-case handling such as empty carts and clamping totals within the Coding & Algorithms domain.
Coding & AlgorithmsOnsite - DoorDashMediumSoftware EngineerCompute courier pay with peak-hour rules
This question evaluates a candidate's data manipulation skills and competency in implementing business rules, including robust error handling, aggregation for per-day totals, minimum-pay enforcement, and time-window (peak-hour) pay adjustments.
Data Manipulation (SQL/Python)Technical Screen - DoorDashMediumSoftware EngineerCompute dasher pay from deliveries
This question evaluates competency in data manipulation, schema design and validation, time-based aggregation, pay-computation logic, and handling of edge cases using SQL or Python.
Data Manipulation (SQL/Python)Onsite - DoorDashMediumSoftware EngineerCompute dasher pay with peak-hour query
This question tests the ability to handle overlapping time intervals and perform weighted calculations based on time-based pay multipliers.
Coding & AlgorithmsOnsiteAlgorithmsIntervalsData Processing - DoorDashMediumSoftware EngineerCompute dasher payout from API data
This question evaluates a candidate's proficiency in data manipulation and transaction aggregation using SQL or Python, encompassing time-zone-aware timestamp handling, pagination, late or missing events, cancellations and negative adjustments, rounding rules, and itemized breakdowns.
Data Manipulation (SQL/Python)Onsite - DoorDashMediumSoftware EngineerCompute delivery times on a grid
This question evaluates understanding of graph traversal and shortest-path algorithms, grid-based pathfinding, and data structure selection for representing sparse or large grids within the Coding & Algorithms domain.
Coding & AlgorithmsTechnical Screen - DoorDashMediumSoftware EngineerCompute earliest arrival in time-grid
This question evaluates algorithmic problem-solving and pathfinding skills on grid-based graphs, focusing on modeling time-dependent traversal constraints and reasoning about efficient search and supporting data structures.
Coding & AlgorithmsTechnical Screen - DoorDashMediumSoftware EngineerCompute nearest dashmart and busiest assignments
Compute nearest dashmart and busiest assignments 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 EngineerCompute nearest dashmart distances for queries
This question evaluates a candidate's understanding of graph traversal and shortest-path computation on grids, spatial reasoning about obstacles and sources, and the ability to analyze algorithmic scalability and complexity when answering many queries.
Coding & AlgorithmsTechnical Screen - DoorDashMediumSoftware EngineerCompute nearest-exit distances in a grid
Compute nearest-exit distances in a grid 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 - DoorDashHardSoftware EngineerCount changed nodes between two menu trees
This problem tests recursive tree traversal and hierarchical diffing strategies to identify structural and content changes between two versions of a menu tree.
Coding & AlgorithmsTechnical ScreenTreesRecursionHash Maps - DoorDashMediumSoftware EngineerCount changed nodes in N-ary trees
This question evaluates understanding of N-ary tree data structures, structural comparison of hierarchical versions, and the ability to reason about time and space complexity when detecting added, deleted, value-changed, or reparented nodes.
Coding & AlgorithmsTechnical Screen - DoorDashMediumSoftware EngineerDebug Round-Robin and Consistent-Hash Routing
This problem tests the ability to identify flaws in load balancing implementations by evaluating consistency, distribution, and edge-case handling in Round-Robin and Consistent Hashing logic.
Software Engineering FundamentalsOnsiteLoad-BalancingConsistent-HashingDistributed-Systems - DoorDashMediumSoftware EngineerDebug a Random Dasher Registry
Debug a random dasher registry backed by a dense array and an ID-to-index map. Repair empty and swap-delete edge cases, preserve representation invariants, narrow error handling, and extend the design for concurrency and slow dependencies.
Software Engineering FundamentalsOnsite - DoorDashMediumSoftware EngineerDebug a Round-Robin Load Balancer, Then Implement Consistent Hashing
Debug a round-robin load balancer that must keep strict rotation while servers are added and removed, then implement a consistent-hash ring that gives each key a stable server. It tests off-by-one and index-mutation bugs, thread safety, stable hashing, virtual nodes, lookup cost, and how many keys move on membership changes.
Software Engineering FundamentalsOnsite - DoorDashHardSoftware EngineerDebug a cache incident end-to-end
This question evaluates a candidate's ability to diagnose and debug production cache incidents, testing competencies in distributed caching, observability, incident response, root-cause analysis, and the operational impact on microservice latency.
Software Engineering FundamentalsTechnical Screen - DoorDashMediumSoftware EngineerDebug a driver assignment bug
This question evaluates debugging, root-cause analysis, unit/integration test design, observability, and system-resilience competencies within the Coding & Algorithms domain, emphasizing practical skills in reproducing failures, isolating defects, and implementing targeted fixes.
Coding & AlgorithmsOnsite
DoorDash