DSA Doctor
Verified Company Vault
Doordash DSA Interview Questions
80 curated coding interview questions directly asked in Doordash technical rounds, sorted by frequency with recency and difficulty diagnostics.
80
Total Questions
7 (9%)
Easy Problems
46 (57%)
Medium Problems
27 (34%)
Hard Problems
🔥 Most Tested Topics:
Core DSA (20)Arrays (17)Strings (14)Trees (8)Design (7)
📂 Sourced Datasets:
Last 3 monthsLast 6 monthsAll questionsOlder than 6 months
| ID | Problem | Difficulty | Topic | Pattern | Acceptance | Frequency | Recency |
|---|---|---|---|---|---|---|---|
| 329 | Longest Increasing Path in a Matrix | Hard | Arrays; Dynamic Programming | Sorting / Prefix / Scan; State Transition | 56.6% | 100.0% | 3m |
| 286 | Walls and Gates | Medium | Core DSA | Implementation / Reasoning | 64.0% | 100.0% | 6m |
| 1235 | Maximum Profit in Job Scheduling | Hard | Arrays | Sorting / Prefix / Scan | 54.7% | 87.5% | 6m |
| 1166 | Design File System | Medium | Design | Data Structure Design | 65.1% | 87.5% | 6m |
| 1268 | Search Suggestions System | Medium | Binary Search | Binary Search | 65.2% | 87.5% | 6m |
| 1834 | Single-Threaded CPU | Medium | Core DSA | Implementation / Reasoning | 47.7% | 87.5% | 6m |
| 456 | 132 Pattern | Medium | Strings | Hashing / Sliding Window | 34.8% | 87.5% | 6m |
| 124 | Binary Tree Maximum Path Sum | Hard | Arrays; Trees | Sorting / Prefix / Scan; DFS / BFS | 42.3% | 87.5% | all |
| 735 | Asteroid Collision | Medium | Core DSA | Implementation / Reasoning | 47.9% | 75.0% | 6m |
| 556 | Next Greater Element III | Medium | Stack / Queue | Monotonic Stack / Simulation | 35.3% | 75.0% | 6m |
| 875 | Koko Eating Bananas | Medium | Binary Search | Binary Search | 50.0% | 75.0% | 6m |
| 317 | Shortest Distance from All Buildings | Hard | Core DSA | Implementation / Reasoning | 44.9% | 75.0% | all |
| 2049 | Count Nodes With the Highest Score | Medium | Trees | DFS / BFS | 52.7% | 62.5% | all |
| 1359 | Count All Valid Pickup and Delivery Options | Hard | Strings | Hashing / Sliding Window | 64.9% | 62.5% | all |
| 1347 | Minimum Number of Steps to Make Two Strings Anagram | Medium | Arrays; Strings | Sorting / Prefix / Scan; Hashing / Sliding Window | 82.5% | 62.5% | all |
| 588 | Design In-Memory File System | Hard | Design | Data Structure Design | 48.4% | 62.5% | all |
| 658 | Find K Closest Elements | Medium | Core DSA | Implementation / Reasoning | 49.7% | 62.5% | all |
| 772 | Basic Calculator III | Hard | Stack / Queue | Monotonic Stack / Simulation | 53.3% | 62.5% | all |
| 826 | Most Profit Assigning Work | Medium | Core DSA | Implementation / Reasoning | 56.2% | 62.5% | all |
| 827 | Making A Large Island | Hard | Graphs | BFS / DFS / Topological Sort | 56.6% | 62.5% | all |
| 859 | Buddy Strings | Easy | Strings | Hashing / Sliding Window | 34.0% | 62.5% | all |
| 1790 | Check if One String Swap Can Make Strings Equal | Easy | Strings | Hashing / Sliding Window | 49.5% | 62.5% | all |
| 1 | Two Sum | Easy | Arrays | Sorting / Prefix / Scan; Two Pointers | 57.5% | 50.0% | all |
| 986 | Interval List Intersections | Medium | Arrays; Linked List | Sorting / Prefix / Scan; Two Pointers | 73.0% | 50.0% | all |
| 987 | Vertical Order Traversal of a Binary Tree | Hard | Trees | DFS / BFS | 53.8% | 50.0% | all |
| 31 | Next Permutation | Medium | Backtracking | Backtracking | 45.3% | 50.0% | all |
| 84 | Largest Rectangle in Histogram | Hard | Core DSA | Implementation / Reasoning | 49.9% | 50.0% | all |
| 208 | Implement Trie (Prefix Tree) | Medium | Trees | DFS / BFS | 69.5% | 50.0% | all |
| 210 | Course Schedule II | Medium | Graphs | BFS / DFS / Topological Sort | 55.5% | 50.0% | all |
| 224 | Basic Calculator | Hard | Stack / Queue | Monotonic Stack / Simulation | 46.9% | 50.0% | all |
| 1143 | Longest Common Subsequence | Medium | Core DSA | Implementation / Reasoning | 59.2% | 50.0% | all |
| 227 | Basic Calculator II | Medium | Stack / Queue | Monotonic Stack / Simulation | 46.9% | 50.0% | all |
| 1173 | Immediate Food Delivery I | Easy | Core DSA | Implementation / Reasoning | 80.6% | 50.0% | all |
| 1174 | Immediate Food Delivery II | Medium | Core DSA | Implementation / Reasoning | 56.0% | 50.0% | all |
| 297 | Serialize and Deserialize Binary Tree | Hard | Trees; Design | DFS / BFS; Data Structure Design | 60.8% | 50.0% | all |
| 2565 | Subsequence With the Minimum Score | Hard | Arrays | Sorting / Prefix / Scan | 33.3% | 50.0% | all |
| 2611 | Mice and Cheese | Medium | Core DSA | Implementation / Reasoning | 48.8% | 50.0% | all |
| 1779 | Find Nearest Point That Has the Same X or Y Coordinate | Easy | Core DSA | Implementation / Reasoning | 70.0% | 50.0% | all |
| 695 | Max Area of Island | Medium | Graphs | BFS / DFS / Topological Sort | 74.0% | 50.0% | all |
| 542 | 01 Matrix | Medium | Arrays | Sorting / Prefix / Scan | 53.9% | 50.0% | all |
| 209 | Minimum Size Subarray Sum | Medium | Arrays | Sorting / Prefix / Scan | 51.7% | 50.0% | all |
| 37 | Sudoku Solver | Hard | Backtracking | Backtracking | 65.5% | 37.5% | all |
| 55 | Jump Game | Medium | Greedy | Greedy | 40.9% | 37.5% | all |
| 146 | LRU Cache | Medium | Design | Data Structure Design | 47.4% | 37.5% | all |
| 200 | Number of Islands | Medium | Graphs | BFS / DFS / Topological Sort | 64.4% | 37.5% | all |
| 212 | Word Search II | Hard | Strings; Binary Search | Hashing / Sliding Window; Binary Search | 38.5% | 37.5% | all |
| 239 | Sliding Window Maximum | Hard | Arrays | Sorting / Prefix / Scan; Sliding Window | 48.8% | 37.5% | all |
| 1944 | Number of Visible People in a Queue | Hard | Stack / Queue | Monotonic Stack / Simulation | 73.1% | 37.5% | all |
| 296 | Best Meeting Point | Hard | Greedy | Greedy | 61.4% | 37.5% | all |
| 1730 | Shortest Path to Get Food | Medium | Core DSA | Implementation / Reasoning | 57.2% | 37.5% | all |
| 778 | Swim in Rising Water | Hard | Core DSA | Implementation / Reasoning | 67.8% | 37.5% | all |
| 1905 | Count Sub Islands | Medium | Graphs | BFS / DFS / Topological Sort | 73.0% | 37.5% | all |
| 314 | Binary Tree Vertical Order Traversal | Medium | Trees | DFS / BFS | 57.8% | 37.5% | all |
| 1664 | Ways to Make a Fair Array | Medium | Arrays | Sorting / Prefix / Scan | 66.9% | 37.5% | all |
| 924 | Minimize Malware Spread | Hard | Core DSA | Implementation / Reasoning | 43.2% | 37.5% | all |
| 480 | Sliding Window Median | Hard | Heap | Priority Queue; Sliding Window | 39.0% | 37.5% | all |
| 18 | 4Sum | Medium | Arrays | Sorting / Prefix / Scan | 40.6% | 37.5% | all |
| 380 | Insert Delete GetRandom O(1) | Medium | Core DSA | Implementation / Reasoning | 55.4% | 37.5% | all |
| 23 | Merge k Sorted Lists | Hard | Arrays; Linked List; Heap | Sorting / Prefix / Scan; Two Pointers; Priority Queue | 59.6% | 37.5% | all |
| 839 | Similar String Groups | Hard | Strings | Hashing / Sliding Window | 56.3% | 37.5% | all |
| 207 | Course Schedule | Medium | Graphs | BFS / DFS / Topological Sort | 51.4% | 37.5% | all |
| 12 | Integer to Roman | Medium | Strings | Hashing / Sliding Window | 71.0% | 37.5% | all |
| 56 | Merge Intervals | Medium | Arrays | Sorting / Prefix / Scan | 51.8% | 37.5% | all |
| 45 | Jump Game II | Medium | Greedy | Greedy | 42.9% | 25.0% | all |
| 2065 | Maximum Path Quality of a Graph | Hard | Arrays; Graphs | Sorting / Prefix / Scan; BFS / DFS / Topological Sort | 62.2% | 25.0% | all |
| 164 | Maximum Gap | Medium | Arrays | Sorting / Prefix / Scan | 52.1% | 25.0% | all |
| 211 | Design Add and Search Words Data Structure | Medium | Strings; Binary Search; Design | Hashing / Sliding Window; Binary Search; Data Structure Design | 48.5% | 25.0% | all |
| 1472 | Design Browser History | Medium | Design | Data Structure Design | 78.3% | 25.0% | all |
| 460 | LFU Cache | Hard | Design | Data Structure Design | 49.2% | 25.0% | all |
| 1152 | Analyze User Website Visit Pattern | Medium | Strings | Hashing / Sliding Window | 44.3% | 25.0% | all |
| 49 | Group Anagrams | Medium | Strings | Hashing / Sliding Window | 72.6% | 25.0% | all |
| 1087 | Brace Expansion | Medium | Core DSA | Implementation / Reasoning | 66.9% | 25.0% | all |
| 304 | Range Sum Query 2D - Immutable | Medium | Arrays | Sorting / Prefix / Scan | 58.3% | 25.0% | all |
| 5 | Longest Palindromic Substring | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS | 37.8% | 25.0% | all |
| 854 | K-Similar Strings | Hard | Strings | Hashing / Sliding Window | 40.9% | 25.0% | all |
| 13 | Roman to Integer | Easy | Strings | Hashing / Sliding Window | 66.6% | 25.0% | all |
| 3123 | Find Edges in Shortest Paths | Hard | Core DSA | Implementation / Reasoning | 46.7% | 25.0% | all |
| 994 | Rotting Oranges | Medium | Core DSA | Implementation / Reasoning | 58.7% | 25.0% | all |
| 2 | Add Two Numbers | Medium | Core DSA | Implementation / Reasoning | 48.5% | 25.0% | all |
| 543 | Diameter of Binary Tree | Easy | Trees | DFS / BFS | 65.5% | 25.0% | all |