DoorDash
69 problems
| Problem | Difficulty | Frequency ↓ | Topics |
|---|---|---|---|
| 2065. Maximum Path Quality of a Graph | Hard | 35.9% | TopicsArrayBacktrackingGraph Theory |
| 146. LRU Cache | Medium | 35.9% | TopicsHash TableLinked ListDesignDoubly-Linked List |
| 200. Number of Islands | Medium | 35.9% | TopicsArrayDepth-First SearchBreadth-First SearchUnion-FindMatrix |
| Binary Tree Vertical Order Traversal | Medium | 35.9% | TopicsHash TableTreeDepth-First SearchBreadth-First SearchSortingBinary Tree |
| 4Sum | Medium | 35.9% | TopicsArrayTwo PointersSorting |
| Insert Delete GetRandom O(1) | Medium | 35.9% | TopicsArrayHash TableMathDesignRandomized |
| 23. Merge k Sorted Lists | Hard | 35.9% | TopicsLinked ListDivide and ConquerHeap (Priority Queue)Merge SortTournament Sort |
| 839. Similar String Groups | Hard | 35.9% | TopicsArrayHash TableStringDepth-First SearchBreadth-First SearchUnion-Find |
| 12. Integer to Roman | Medium | 35.9% | TopicsHash TableMathString |
| 45. Jump Game II | Medium | 28.9% | TopicsArrayDynamic ProgrammingGreedy |
| Shortest Path to Get Food | Medium | 28.9% | TopicsArrayBreadth-First SearchMatrix |
| 778. Swim in Rising Water | Hard | 28.9% | TopicsArrayBinary SearchDepth-First SearchBreadth-First SearchUnion-FindMinimaxHeap (Priority Queue)MatrixDijkstra's Algorithm |
| 1087. Brace Expansion | Medium | 28.9% | TopicsStringBacktrackingStackBreadth-First SearchSorting |
| 5. Longest Palindromic Substring | Medium | 28.9% | TopicsTwo PointersStringDynamic ProgrammingManacher |
| 13. Roman to Integer | Easy | 28.9% | TopicsHash TableMathString |
| 3123. Find Edges in Shortest Paths | Hard | 28.9% | TopicsDepth-First SearchBreadth-First SearchGraph TheoryHeap (Priority Queue)Shortest Path |
| 994. Rotting Oranges | Medium | 28.9% | TopicsArrayBreadth-First SearchMatrix |
| 2. Add Two Numbers | Medium | 28.9% | TopicsLinked ListMathRecursion |
| 543. Diameter of Binary Tree | Easy | 28.9% | TopicsTreeDepth-First SearchBinary TreeDP on Trees |
