DoorDash LeetCode Questions
78 questions all-time · 7 easy · 45 medium · 26 hard
| # | Problem | Difficulty | Frequency | Acceptance |
|---|---|---|---|---|
| 1 | Walls and Gates Array, Breadth-First Search, Matrix | Medium | 100 | 0.6% |
| 2 | Longest Increasing Path in a Matrix Array, Dynamic Programming, Depth-First Search, Breadth-First Search, Graph Theory, Topological Sort, Memoization, Matrix | Hard | 93 | 0.6% |
| 3 | Binary Tree Maximum Path Sum Dynamic Programming, Tree, Depth-First Search, Binary Tree | Hard | 91 | 0.4% |
| 4 | Search Suggestions System Array, String, Binary Search, Trie, Sorting, Heap (Priority Queue) | Medium | 82 | 0.7% |
| 5 | Maximum Profit in Job Scheduling Array, Binary Search, Dynamic Programming, Sorting | Hard | 78 | 0.5% |
| 6 | Koko Eating Bananas Array, Binary Search | Medium | 76 | 0.5% |
| 7 | Single-Threaded CPU Array, Sorting, Heap (Priority Queue) | Medium | 75 | 0.5% |
| 8 | Design File System Hash Table, String, Design, Trie | Medium | 72 | 0.7% |
| 9 | Shortest Distance from All Buildings Array, Breadth-First Search, Matrix | Hard | 71 | 0.4% |
| 10 | Check if One String Swap Can Make Strings Equal Hash Table, String, Counting | Easy | 67 | 0.5% |
| 11 | Most Profit Assigning Work Array, Two Pointers, Binary Search, Greedy, Sorting | Medium | 66 | 0.6% |
| 12 | Next Greater Element III Math, Two Pointers, String | Medium | 65 | 0.4% |
| 13 | Design In-Memory File System Hash Table, String, Design, Trie, Sorting | Hard | 65 | 0.5% |
| 14 | Buddy Strings Hash Table, String | Easy | 65 | 0.3% |
| 15 | Minimum Number of Steps to Make Two Strings Anagram Hash Table, String, Counting | Medium | 64 | 0.8% |
| 16 | Find K Closest Elements Array, Two Pointers, Binary Search, Sliding Window, Sorting, Heap (Priority Queue) | Medium | 64 | 0.5% |
| 17 | Making A Large Island Array, Depth-First Search, Breadth-First Search, Union-Find, Matrix | Hard | 62 | 0.6% |
| 18 | Basic Calculator III Math, String, Stack, Recursion | Hard | 61 | 0.5% |
| 19 | Count Nodes With the Highest Score Array, Tree, Depth-First Search, Binary Tree | Medium | 59 | 0.5% |
| 20 | Count All Valid Pickup and Delivery Options Math, Dynamic Programming, Combinatorics | Hard | 58 | 0.6% |
| 21 | Interval List Intersections Array, Two Pointers, Sweep Line | Medium | 55 | 0.7% |
| 22 | Immediate Food Delivery I Database | Easy | 55 | 0.8% |
| 23 | Immediate Food Delivery II Database | Medium | 55 | 0.6% |
| 24 | Subsequence With the Minimum Score Two Pointers, String, Binary Search | Hard | 55 | 0.3% |
| 25 | Mice and Cheese Array, Greedy, Sorting, Heap (Priority Queue) | Medium | 55 | 0.5% |
| 26 | Find Nearest Point That Has the Same X or Y Coordinate Array | Easy | 53 | 0.7% |
| 27 | Vertical Order Traversal of a Binary Tree Hash Table, Tree, Depth-First Search, Breadth-First Search, Sorting, Binary Tree | Hard | 51 | 0.5% |
| 28 | Implement Trie (Prefix Tree) Hash Table, String, Design, Trie | Medium | 51 | 0.7% |
| 29 | Course Schedule II Depth-First Search, Breadth-First Search, Graph Theory, Topological Sort | Medium | 51 | 0.6% |
| 30 | 01 Matrix Array, Dynamic Programming, Breadth-First Search, Matrix | Medium | 51 | 0.5% |
| 31 | Two Sum Array, Hash Table | Easy | 48 | 0.6% |
| 32 | Next Permutation Array, Two Pointers | Medium | 48 | 0.5% |
| 33 | Largest Rectangle in Histogram Array, Stack, Monotonic Stack | Hard | 48 | 0.5% |
| 34 | Basic Calculator Math, String, Stack, Recursion | Hard | 48 | 0.5% |
| 35 | Max Area of Island Array, Depth-First Search, Breadth-First Search, Union-Find, Matrix | Medium | 48 | 0.7% |
| 36 | Minimum Size Subarray Sum Array, Binary Search, Sliding Window, Prefix Sum | Medium | 48 | 0.5% |
| 37 | 132 Pattern Array, Binary Search, Stack, Monotonic Stack, Ordered Set | Medium | 48 | 0.3% |
| 38 | Longest Common Subsequence String, Dynamic Programming | Medium | 46 | 0.6% |
| 39 | Basic Calculator II Math, String, Stack | Medium | 46 | 0.5% |
| 40 | Serialize and Deserialize Binary Tree String, Tree, Depth-First Search, Breadth-First Search, Design, Binary Tree | Hard | 46 | 0.6% |
| 41 | Word Search II Array, String, Backtracking, Trie, Matrix | Hard | 43 | 0.4% |
| 42 | Best Meeting Point Array, Math, Sorting, Matrix | Hard | 43 | 0.6% |
| 43 | Asteroid Collision Array, Stack, Simulation | Medium | 43 | 0.5% |
| 44 | Number of Islands Array, Depth-First Search, Breadth-First Search, Union-Find, Matrix | Medium | 39 | 0.6% |
| 45 | Sliding Window Maximum Array, Queue, Sliding Window, Heap (Priority Queue), Monotonic Queue | Hard | 39 | 0.5% |
| 46 | Shortest Path to Get Food Array, Breadth-First Search, Matrix | Medium | 39 | 0.6% |
| 47 | Ways to Make a Fair Array Array, Prefix Sum | Medium | 39 | 0.7% |
| 48 | Minimize Malware Spread Array, Hash Table, Depth-First Search, Breadth-First Search, Union-Find, Graph Theory | Hard | 39 | 0.4% |
| 49 | Sliding Window Median Array, Hash Table, Sliding Window, Heap (Priority Queue) | Hard | 39 | 0.4% |
| 50 | Course Schedule Depth-First Search, Breadth-First Search, Graph Theory, Topological Sort | Medium | 39 | 0.5% |
| 51 | Sudoku Solver Array, Hash Table, Backtracking, Matrix | Hard | 34 | 0.7% |
| 52 | Jump Game Array, Dynamic Programming, Greedy | Medium | 34 | 0.4% |
| 53 | LRU Cache Hash Table, Linked List, Design, Doubly-Linked List | Medium | 34 | 0.5% |
| 54 | Swim in Rising Water Array, Binary Search, Depth-First Search, Breadth-First Search, Union-Find, Heap (Priority Queue), Matrix | Hard | 34 | 0.7% |
| 55 | Count Sub Islands Array, Depth-First Search, Breadth-First Search, Union-Find, Matrix | Medium | 34 | 0.7% |
| 56 | Binary Tree Vertical Order Traversal Hash Table, Tree, Depth-First Search, Breadth-First Search, Sorting, Binary Tree | Medium | 34 | 0.6% |
| 57 | 4Sum Array, Two Pointers, Sorting | Medium | 34 | 0.4% |
| 58 | Insert Delete GetRandom O(1) Array, Hash Table, Math, Design, Randomized | Medium | 34 | 0.6% |
| 59 | Merge k Sorted Lists Linked List, Divide and Conquer, Heap (Priority Queue), Merge Sort | Hard | 34 | 0.6% |
| 60 | Similar String Groups Array, Hash Table, String, Depth-First Search, Breadth-First Search, Union-Find | Hard | 34 | 0.6% |
| 61 | Integer to Roman Hash Table, Math, String | Medium | 34 | 0.7% |
| 62 | Merge Intervals Array, Sorting | Medium | 34 | 0.5% |
| 63 | Jump Game II Array, Dynamic Programming, Greedy | Medium | 27 | 0.4% |
| 64 | Maximum Path Quality of a Graph Array, Backtracking, Graph Theory | Hard | 27 | 0.6% |
| 65 | Maximum Gap Array, Sorting, Bucket Sort, Radix Sort | Medium | 27 | 0.5% |
| 66 | Design Add and Search Words Data Structure String, Depth-First Search, Design, Trie | Medium | 27 | 0.5% |
| 67 | Number of Visible People in a Queue Array, Stack, Monotonic Stack | Hard | 27 | 0.7% |
| 68 | Design Browser History Array, Linked List, Stack, Design, Doubly-Linked List, Data Stream | Medium | 27 | 0.8% |
| 69 | LFU Cache Hash Table, Linked List, Design, Doubly-Linked List | Hard | 27 | 0.5% |
| 70 | Group Anagrams Array, Hash Table, String, Sorting | Medium | 27 | 0.7% |
| 71 | Brace Expansion String, Backtracking, Stack, Breadth-First Search, Sorting | Medium | 27 | 0.7% |
| 72 | Range Sum Query 2D - Immutable Array, Design, Matrix, Prefix Sum | Medium | 27 | 0.6% |
| 73 | Longest Palindromic Substring Two Pointers, String, Dynamic Programming | Medium | 27 | 0.4% |
| 74 | Roman to Integer Hash Table, Math, String | Easy | 27 | 0.7% |
| 75 | Find Edges in Shortest Paths Depth-First Search, Breadth-First Search, Graph Theory, Heap (Priority Queue), Shortest Path | Hard | 27 | 0.5% |
| 76 | Rotting Oranges Array, Breadth-First Search, Matrix | Medium | 27 | 0.6% |
| 77 | Add Two Numbers Linked List, Math, Recursion | Medium | 27 | 0.5% |
| 78 | Diameter of Binary Tree Tree, Depth-First Search, Binary Tree | Easy | 27 | 0.7% |
How to read this list
The tabs at the top split the questions by how recently people said they were asked in interviews. "Last 30 Days" is the past month, "Last 3 Months" is the past quarter, and so on. "All Time" is every question on record for this company.
Frequency is a score from 0 to 100 for how often a question showed up in that time window. A higher number means it came up more often, so the list starts with the most common questions first. Acceptance is the share of submissions that pass on LeetCode. Click any question to open it on LeetCode.