DoorDash Coding Interview Questions
We track 79 coding questions asked at DoorDash, tagged with the algorithms and concepts they test. The most common: Array, String, Depth-First Search, Hash Table, Breadth-First Search.
Browse all 79 DoorDash questions →Concept mix
Each question's weight is split evenly across its concepts, so the shares sum to 100%.
- Array17.7%
- String8.3%
- Hash Table7.1%
- Depth-First Search5.1%
- Breadth-First Search4.9%
- Sorting4.2%
- Dynamic Programming3.9%
- Two Pointers3.7%
- Math3.6%
- Matrix3.4%
- Other (34)38.4%
How many questions involve each concept
Share of all 79 tracked DoorDash questions that touch each concept. Questions usually involve several, so these overlap.
- Array53.2%
- String24.1%
- Depth-First Search21.5%
- Hash Table21.5%
- Breadth-First Search20.3%
- Matrix13.9%
- Sorting13.9%
- Binary Search11.4%
- Dynamic Programming11.4%
- Heap (Priority Queue)11.4%
- Design10.1%
- Math10.1%
Where DoorDash differs from the average company
Concept weight at DoorDash relative to the average across all companies we track. Green means DoorDash leans on it harder than most.
- Doubly-Linked List3.3×
- Topological Sort3.0×
- Trie2.6×
- Union-Find2.6×
- Recursion0.73×
- Math0.64×
- Dynamic Programming0.63×
- Greedy0.53×
DoorDash specialties
Concepts that show up at DoorDash but are rarely asked elsewhere. They are easy to get blindsided by.
Difficulty mix
Level split of the 79 tracked DoorDash questions.
- Junior8% (6)
- Mid/Senior56% (44)
- Staff37% (29)
Every concept in DoorDash interviews
| Concept | Questions | % of questions | Share of mix |
|---|---|---|---|
| Array | 42 | 53.2% | 17.7% |
| String | 19 | 24.1% | 8.3% |
| Depth-First Search | 17 | 21.5% | 5.1% |
| Hash Table | 17 | 21.5% | 7.1% |
| Breadth-First Search | 16 | 20.3% | 4.9% |
| Matrix | 11 | 13.9% | 3.4% |
| Sorting | 11 | 13.9% | 4.2% |
| Binary Search | 9 | 11.4% | 3.2% |
| Dynamic Programming | 9 | 11.4% | 3.9% |
| Heap (Priority Queue) | 9 | 11.4% | 2.8% |
| Design | 8 | 10.1% | 2.6% |
| Math | 8 | 10.1% | 3.6% |
| Two Pointers | 8 | 10.1% | 3.7% |
| Stack | 7 | 8.9% | 2.8% |
| Union-Find | 7 | 8.9% | 1.8% |
| Graph Theory | 6 | 7.6% | 1.9% |
| Binary Tree | 5 | 6.3% | 1.7% |
| Linked List | 5 | 6.3% | 1.8% |
| Tree | 5 | 6.3% | 1.7% |
| Greedy | 4 | 5.1% | 1.6% |
| Sliding Window | 4 | 5.1% | 1.3% |
| Trie | 4 | 5.1% | 1.3% |
| Backtracking | 3 | 3.8% | 1.1% |
| Doubly-Linked List | 3 | 3.8% | 1.0% |
| Monotonic Stack | 3 | 3.8% | 1.3% |
| Prefix Sum | 3 | 3.8% | 1.4% |
| Topological Sort | 3 | 3.8% | 0.9% |
| Counting | 2 | 2.5% | 1.0% |
| Recursion | 2 | 2.5% | 0.8% |
| Bucket Sort | 1 | 1.3% | 0.4% |
| Combinatorics | 1 | 1.3% | 0.5% |
| Data Stream | 1 | 1.3% | 0.2% |
| Database | 1 | 1.3% | 1.4% |
| Divide and Conquer | 1 | 1.3% | 0.4% |
| Sweep Line | 1 | 1.3% | 0.5% |
| Memoization | 1 | 1.3% | 0.2% |
| Merge Sort | 1 | 1.3% | 0.4% |
| Monotonic Queue | 1 | 1.3% | 0.3% |
| Ordered Set | 1 | 1.3% | 0.3% |
| Queue | 1 | 1.3% | 0.3% |
| Radix Sort | 1 | 1.3% | 0.4% |
| Randomized | 1 | 1.3% | 0.3% |
| Shortest Path | 1 | 1.3% | 0.3% |
| Simulation | 1 | 1.3% | 0.5% |
Practice a DoorDash interview
Take a realistic AI-led mock interview with questions DoorDash actually asks, with live voice and real feedback.
Start a mock interviewYour first interview is free · no credit card required