DoorDash
Marketplace loops — coding rounds, a design round on logistics and real-time dispatch, and a behavioral round.
Typical loop
- 1Recruiter screen
- 2Technical phone screen
- 3Onsite: two to three coding rounds
- 4System design round
- 5Behavioral round
Questions
Callback's practice questions and the LeetCode questions DoorDash has been asking, filtered together.
Asked on LeetCode
74 questions · all time
- 4SummediumArrayTwo PointersSortingfrequency 34.2
- Binary Tree Vertical Order TraversalmediumHash TableTreeDepth-First SearchBreadth-First Search+2frequency 34.2
- Count Sub IslandsmediumArrayDepth-First SearchBreadth-First SearchUnion-Find+1frequency 34.2
- Insert Delete GetRandom O(1)mediumArrayHash TableMathDesign+1frequency 34.2
- Integer to RomanmediumHash TableMathStringfrequency 34.2
- Jump GamemediumArrayDynamic ProgrammingGreedyfrequency 34.2
- LRU CachemediumHash TableLinked ListDesignDoubly-Linked Listfrequency 34.2
- Maximum Path Quality of a GraphhardArrayBacktrackingGraph Theoryfrequency 34.2
- Merge k Sorted ListshardLinked ListDivide and ConquerHeap (Priority Queue)Merge Sort+1frequency 34.2
- Similar String GroupshardArrayHash TableStringDepth-First Search+2frequency 34.2
- Sudoku SolverhardArrayHash TableBacktrackingMatrix+2frequency 34.2
- Swim in Rising WaterhardArrayBinary SearchDepth-First SearchBreadth-First Search+5frequency 34.2
- Add Two NumbersmediumLinked ListMathRecursionfrequency 27.3
- Brace ExpansionmediumStringBacktrackingStackBreadth-First Search+1frequency 27.3
- Design Add and Search Words Data StructuremediumStringDepth-First SearchDesignTriefrequency 27.3
- Design Browser HistorymediumArrayLinked ListStackDesign+2frequency 27.3
- Diameter of Binary TreeeasyTreeDepth-First SearchBinary TreeDP on Treesfrequency 27.3
- Find Edges in Shortest PathshardDepth-First SearchBreadth-First SearchGraph TheoryHeap (Priority Queue)+1frequency 27.3
- Jump Game IImediumArrayDynamic ProgrammingGreedyfrequency 27.3
- LFU CachehardHash TableLinked ListDesignDoubly-Linked Listfrequency 27.3
- Longest Palindromic SubstringmediumTwo PointersStringDynamic ProgrammingManacherfrequency 27.3
- Roman to IntegereasyHash TableMathStringfrequency 27.3
- Rotting OrangesmediumArrayBreadth-First SearchMatrixfrequency 27.3
- Shortest Path to Get FoodmediumArrayBreadth-First SearchMatrixfrequency 27.3