DoorDashLeetCode Questions
VerifiedCompany-wise coding interview questions asked by DoorDash, ranked by real frequency across 30-day, 3-month, and 6-month recency windows.
# | Problem | Difficulty | Frequency↓ | Acceptance | |
|---|---|---|---|---|---|
| #286 | Walls and Gates3 sources | Medium | 100% | 64.1% | |
| #329 | Longest Increasing Path in a Matrix3 sources | Hard | 93% | 56.8% | |
| #124 | Binary Tree Maximum Path Sum3 sources | Hard | 90% | 42.5% | |
| #1268 | Search Suggestions System3 sources | Medium | 88% | 65.2% | |
| #1235 | Maximum Profit in Job Scheduling3 sources | Hard | 78% | 54.8% | |
| #875 | Koko Eating Bananas3 sources | Medium | 76% | 50.2% | |
| #1834 | Single-Threaded CPU3 sources | Medium | 75% | 47.8% | |
| #1166 | Design File System3 sources | Medium | 75% | 65.2% | |
| #317 | Shortest Distance from All Buildings3 sources | Hard | 75% | 45.0% | |
| #826 | Most Profit Assigning Work3 sources | Medium | 67% | 56.3% | |
| #588 | Design In-Memory File System3 sources | Hard | 66% | 48.3% | |
| #859 | Buddy Strings3 sources | Easy | 66% | 34.1% | |
| #556 | Next Greater Element III3 sources | Medium | 65% | 35.4% | |
| #658 | Find K Closest Elements3 sources | Medium | 65% | 49.9% | |
| #1790 | Easy | 65% | 49.5% | ||
| #1347 | Medium | 64% | 82.6% | ||
| #2049 | Count Nodes With the Highest Score3 sources | Medium | 63% | 52.9% | |
| #772 | Basic Calculator III3 sources | Hard | 63% | 53.4% | |
| #827 | Making A Large Island3 sources | Hard | 63% | 56.9% | |
| #1359 | Hard | 63% | 64.9% | ||
| #986 | Interval List Intersections3 sources | Medium | 51% | 73.1% | |
| #987 | Hard | 51% | 54.2% | ||
| #1173 | Easy | 51% | 80.6% | ||
| #1174 | Medium | 51% | 56.4% | ||
| #2565 | Subsequence With the Minimum Score3 sources | Hard | 51% | 33.5% | |
| #2611 | Mice and Cheese3 sources | Medium | 51% | 48.9% | |
| #1779 | Easy | 51% | 70.1% | ||
| #542 | 01 Matrix3 sources | Medium | 51% | 54.4% | |
| #456 | 132 Pattern3 sources | Medium | 51% | 34.9% | |
| #1 | Two Sum3 sources | Easy | 50% | 57.8% | |
| #84 | Largest Rectangle in Histogram3 sources | Hard | 50% | 50.3% | |
| #209 | Minimum Size Subarray Sum3 sources | Medium | 50% | 52.2% | |
| #31 | Next Permutation3 sources | Medium | 50% | 45.6% | |
| #208 | Implement Trie (Prefix Tree)3 sources | Medium | 50% | 69.7% | |
| #210 | Course Schedule II3 sources | Medium | 50% | 55.9% | |
| #224 | Basic Calculator3 sources | Hard | 50% | 47.0% | |
| #227 | Basic Calculator II3 sources | Medium | 50% | 47.0% | |
| #297 | Hard | 50% | 61.1% | ||
| #695 | Max Area of Island3 sources | Medium | 50% | 74.1% | |
| #1143 | Longest Common Subsequence3 sources | Medium | 50% | 59.3% | |
| #212 | Word Search II3 sources | Hard | 43% | 38.6% | |
| #296 | Best Meeting Point3 sources | Hard | 43% | 61.5% | |
| #735 | Asteroid Collision3 sources | Medium | 43% | 48.4% | |
| #200 | Number of Islands3 sources | Medium | 39% | 64.7% | |
| #239 | Sliding Window Maximum3 sources | Hard | 39% | 49.0% | |
| #1664 | Ways to Make a Fair Array3 sources | Medium | 39% | 67.3% | |
| #924 | Minimize Malware Spread3 sources | Hard | 39% | 43.3% | |
| #480 | Sliding Window Median3 sources | Hard | 39% | 39.0% | |
| #207 | Course Schedule3 sources | Medium | 39% | 51.8% | |
| #56 | Merge Intervals3 sources | Medium | 39% | 52.3% | |
| #37 | Sudoku Solver3 sources | Hard | 38% | 65.6% | |
| #55 | Jump Game3 sources | Medium | 38% | 41.2% | |
| #146 | LRU Cache3 sources | Medium | 38% | 47.6% | |
| #778 | Swim in Rising Water3 sources | Hard | 38% | 68.0% | |
| #1905 | Count Sub Islands3 sources | Medium | 38% | 73.0% | |
| #314 | Binary Tree Vertical Order Traversal3 sources | Medium | 38% | 57.9% | |
| #18 | 4Sum3 sources | Medium | 38% | 41.1% | |
| #380 | Insert Delete GetRandom O(1)3 sources | Medium | 38% | 55.4% | |
| #23 | Merge k Sorted Lists3 sources | Hard | 38% | 60.0% | |
| #839 | Similar String Groups3 sources | Hard | 38% | 56.4% | |
| #12 | Integer to Roman3 sources | Medium | 38% | 71.2% | |
| #1730 | Shortest Path to Get Food3 sources | Medium | 38% | 57.3% | |
| #2065 | Maximum Path Quality of a Graph3 sources | Hard | 34% | 62.6% | |
| #45 | Jump Game II3 sources | Medium | 27% | 43.1% | |
| #211 | Medium | 27% | 48.7% | ||
| #1472 | Design Browser History3 sources | Medium | 27% | 78.4% | |
| #460 | LFU Cache3 sources | Hard | 27% | 49.7% | |
| #1087 | Brace Expansion3 sources | Medium | 27% | 66.9% | |
| #5 | Longest Palindromic Substring3 sources | Medium | 27% | 38.2% | |
| #13 | Roman to Integer3 sources | Easy | 27% | 66.8% | |
| #3123 | Find Edges in Shortest Paths3 sources | Hard | 27% | 46.9% | |
| #994 | Rotting Oranges3 sources | Medium | 27% | 59.0% | |
| #2 | Add Two Numbers3 sources | Medium | 27% | 48.8% | |
| #543 | Diameter of Binary Tree3 sources | Easy | 27% | 65.8% | |
| #1944 | Hard | 25% | 73.3% | ||
| #49 | Medium | 25% | 72.9% | ||
| #304 | Medium | 25% | 58.6% |
DoorDash Technical Interview Overview & Company-Wise Questions
Software engineering and technical interviews at DoorDash emphasize real-world problem solving, algorithmic efficiency, and scalable data structure design. The curated dataset above contains 77 verified LeetCode problems, categorized by frequency and filtered across recent interview seasons.
Frequently Asked Questions
What are the top LeetCode questions for DoorDash?
Leading questions include Walls and Gates, Longest Increasing Path in a Matrix, Binary Tree Maximum Path Sum. Reviewing questions with higher recency (within the last 30 to 90 days) yields the highest return on preparation time.
Where can I practice company-wise LeetCode questions for DoorDash?
You can practice all 77 DoorDash LeetCode questions right here on LeetMap Pro. Filter by 30-day, 3-month, and 6-month recency, track your progress with local checkpoints, and practice curated SQL problems completely free.
How should I prepare for DoorDash coding rounds?
Begin by reviewing Medium-difficulty problems (44 tracked), which constitute the majority of technical rounds. Complement coding practice with foundational DSA patterns like Sliding Window, Two Pointers, and Graph Traversal.