Problems
Callback's own problems and the LeetCode questions companies have been asking, in one place — filter by category, company, topic, difficulty, and how recently a question showed up.
Asked on LeetCode
74 questions at DoorDash · all time
- Walls and GatesmediumArrayBreadth-First SearchMatrixfrequency 100.0
- Longest Increasing Path in a MatrixhardArrayDynamic ProgrammingDepth-First SearchBreadth-First Search+5frequency 92.5
- Binary Tree Maximum Path SumhardDynamic ProgrammingTreeDepth-First SearchBinary Tree+1frequency 90.2
- Search Suggestions SystemmediumArrayStringBinary SearchTrie+2frequency 82.5
- Maximum Profit in Job SchedulinghardArrayBinary SearchDynamic ProgrammingSortingfrequency 77.8
- Koko Eating BananasmediumArrayBinary Searchfrequency 76.3
- Single-Threaded CPUmediumArraySortingHeap (Priority Queue)frequency 74.6
- Design File SystemmediumHash TableStringDesignTriefrequency 72.7
- Shortest Distance from All BuildingshardArrayBreadth-First SearchMatrixfrequency 71.4
- Most Profit Assigning WorkmediumArrayTwo PointersBinary SearchGreedy+1frequency 67.4
- Buddy StringseasyHash TableStringfrequency 65.6
- Design In-Memory File SystemhardHash TableStringDesignTrie+1frequency 65.6
- Check if One String Swap Can Make Strings EqualeasyHash TableStringCountingfrequency 64.6
- Find K Closest ElementsmediumArrayTwo PointersBinary SearchSliding Window+2frequency 64.6
- Next Greater Element IIImediumMathTwo PointersStringfrequency 64.6
- Minimum Number of Steps to Make Two Strings AnagrammediumHash TableStringCountingfrequency 63.5
- Count Nodes With the Highest ScoremediumArrayTreeDepth-First SearchBinary Tree+1frequency 59.9
- Basic Calculator IIIhardMathStringStackRecursionfrequency 58.4
- Making A Large IslandhardArrayDepth-First SearchBreadth-First SearchUnion-Find+1frequency 58.4
- Count All Valid Pickup and Delivery OptionshardMathDynamic ProgrammingCombinatoricsfrequency 53.4
- 01 MatrixmediumArrayDynamic ProgrammingBreadth-First SearchMatrixfrequency 51.3
- 132 PatternmediumArrayBinary SearchStackMonotonic Stack+1frequency 51.3
- Find Nearest Point That Has the Same X or Y CoordinateeasyArrayfrequency 51.3
- Immediate Food Delivery IeasyDatabasefrequency 51.3
- Immediate Food Delivery IImediumDatabasefrequency 51.3
- Interval List IntersectionsmediumArrayTwo PointersSweep Linefrequency 51.3
- Mice and CheesemediumArrayGreedySortingHeap (Priority Queue)frequency 51.3
- Subsequence With the Minimum ScorehardTwo PointersStringBinary Searchfrequency 51.3
- Vertical Order Traversal of a Binary TreehardHash TableTreeDepth-First SearchBreadth-First Search+2frequency 51.3
- Largest Rectangle in HistogramhardArrayStackMonotonic StackRange Minimum/Maximum Queryfrequency 49.0
- Minimum Size Subarray SummediumArrayBinary SearchSliding WindowPrefix Sumfrequency 49.0
- Two SumeasyArrayHash Tablefrequency 49.0
- Basic CalculatorhardMathStringStackRecursionfrequency 46.3
- Basic Calculator IImediumMathStringStackfrequency 46.3
- Course Schedule IImediumDepth-First SearchBreadth-First SearchGraph TheoryTopological Sortfrequency 46.3
- Implement Trie (Prefix Tree)mediumHash TableStringDesignTriefrequency 46.3
- Max Area of IslandmediumArrayDepth-First SearchBreadth-First SearchUnion-Find+1frequency 46.3
- Next PermutationmediumArrayTwo Pointersfrequency 46.3
- Serialize and Deserialize Binary TreehardStringTreeDepth-First SearchBreadth-First Search+2frequency 46.3
- Asteroid CollisionmediumArrayStackSimulationfrequency 43.1
- Best Meeting PointhardArrayMathSortingMatrixfrequency 43.1
- Longest Common SubsequencemediumStringDynamic ProgrammingLongest Common Subsequencefrequency 43.1
- Word Search IIhardArrayStringBacktrackingTrie+1frequency 43.1
- Course SchedulemediumDepth-First SearchBreadth-First SearchGraph TheoryTopological Sort+1frequency 39.2
- Merge IntervalsmediumArraySortingQuicksortfrequency 39.2
- Minimize Malware SpreadhardArrayHash TableDepth-First SearchBreadth-First Search+2frequency 39.2
- Number of IslandsmediumArrayDepth-First SearchBreadth-First SearchUnion-Find+1frequency 39.2
- Sliding Window MaximumhardArrayQueueSliding WindowHeap (Priority Queue)+2frequency 39.2
- Sliding Window MedianhardArrayHash TableSliding WindowHeap (Priority Queue)+1frequency 39.2
- Ways to Make a Fair ArraymediumArrayPrefix Sumfrequency 39.2
Listings only — titles, difficulty, and tags link out to LeetCode. Imported from the leetcode-company-wise-problems snapshot dated 1 June 2025. Frequency is that dataset's own relative score within a company and time range.