D
DoorDash
88 questions tracked71 with solutions
Frequency scoreSorted highest → lowest frequency✓ Our Solution = we have a detailed walkthrough
Showing 88 of 88 questions
1MediumWalls and Gates
ArrayBreadth-First SearchMatrix
2Dynamic ProgrammingTreeDepth-First SearchBinary Tree
3ArrayDynamic ProgrammingDepth-First SearchBreadth-First Search+4
4ArrayBinary SearchDynamic ProgrammingSorting
5ArrayStringBinary SearchTrie+2
7MediumDesign File System
Hash TableStringDesignTrie
8ArrayTwo PointersBinary SearchGreedy+1
10HardShortest Distance from All Buildings
ArrayBreadth-First SearchMatrix
11ArraySortingHeap (Priority Queue)
12MediumMinimum Number of Steps to Make Two Strings Anagram✓ Our Solution Hash TableStringCounting
13ArrayTwo PointersBinary SearchSliding Window+2
16HardDesign In-Memory File System
Hash TableStringDesignTrie+1
17EasyFind Nearest Point That Has the Same X or Y Coordinate✓ Our Solution Array
18HardBasic Calculator III
MathStringStackRecursion
19ArrayDepth-First SearchBreadth-First SearchUnion Find+1
20ArrayDepth-First SearchBreadth-First SearchUnion Find+1
22ArrayTreeDepth-First SearchBinary Tree
23StringTreeDepth-First SearchBreadth-First Search+2
25MathDynamic ProgrammingCombinatorics
26HardBest Meeting Point
ArrayMathSortingMatrix
27Depth-First SearchBreadth-First SearchGraphTopological Sort
28Hash TableTreeDepth-First SearchBreadth-First Search+2
30EasyImmediate Food Delivery I
Database
31Hash TableStringDesignTrie
33ArrayTwo PointersLine Sweep
34ArrayGreedySortingHeap (Priority Queue)
35Two PointersStringBinary Search
36ArrayDynamic ProgrammingGreedy
38ArrayHash TableGreedySorting+2
39ArrayStackMonotonic Stack
40ArrayDynamic ProgrammingBreadth-First SearchMatrix
41ArrayDepth-First SearchBreadth-First SearchUnion Find+1
43ArrayStringBacktrackingTrie+1
44StringDynamic Programming
45ArrayBinary SearchDepth-First SearchBreadth-First Search+3
46ArrayBinary SearchSliding WindowPrefix Sum
47ArrayStackMonotonic Stack
48StringDepth-First SearchDesignTrie
49ArrayHash TableBacktrackingMatrix
50ArrayDynamic ProgrammingGreedy
52ArrayHash TableDepth-First SearchBreadth-First Search+2
53MediumBinary Tree Vertical Order Traversal
Hash TableTreeDepth-First SearchBreadth-First Search+2
54ArraySortingBucket SortRadix Sort
55Hash TableLinked ListDesignDoubly-Linked List
56ArrayDepth-First SearchBreadth-First SearchUnion Find+1
57ArrayHash TableSliding WindowHeap (Priority Queue)
58ArrayQueueSliding WindowHeap (Priority Queue)+1
59MediumShortest Path to Get Food
ArrayBreadth-First SearchMatrix
61Depth-First SearchBreadth-First SearchGraphTopological Sort
62MediumAnalyze User Website Visit Pattern
ArrayHash TableSorting
63Hash TableLinked ListDesignDoubly-Linked List
66MediumFind the Celebrity
Two PointersGraphInteractive
67Depth-First SearchBreadth-First SearchUnion FindGraph
68BacktrackingTreeDepth-First SearchBinary Tree
69ArrayGreedySortingHeap (Priority Queue)
70HardDesign Search Autocomplete System
StringDepth-First SearchDesignTrie+3
71Two PointersStringDynamic Programming
72ArrayHash TableStringDepth-First Search+2
73Linked ListDivide and ConquerHeap (Priority Queue)Merge Sort
74ArrayHash TableMathDesign+1
75ArrayDesignMatrixPrefix Sum
76MediumDiameter of N-Ary Tree
TreeDepth-First Search
77HardEmployee Free Time
ArrayLine SweepSortingHeap (Priority Queue)
78ArrayStringString Matching
79MediumBrace Expansion
StringBacktrackingBreadth-First Search
80ArrayLinked ListStackDesign+2
81MediumPath With Maximum Minimum Value
ArrayBinary SearchDepth-First SearchBreadth-First Search+3
82ArrayDepth-First SearchBreadth-First SearchUnion Find+1
84ArrayHash TableDivide and ConquerSorting+4
85ArrayHash TableSimulation
86ArrayHash TableStringSorting
87MediumImplement Trie II (Prefix Tree)
Hash TableStringDesignTrie
88StringBreadth-First Search
