DoorDash Interview Questions — 88 DSA Problems

71 problems with full solutions in Python, Java, C++, JavaScript, Go, Rust.

Most frequently asked DoorDash LeetCode questions for software engineering interviews.

• Walls and Gates (MEDIUM) — Array, Breadth-First Search, Matrix
• Binary Tree Maximum Path Sum (HARD) — Dynamic Programming, Tree, Depth-First Search, Binary Tree
• Longest Increasing Path in a Matrix (HARD) — Array, Dynamic Programming, Depth-First Search, Breadth-First Search, Graph, Topological Sort, Memoization, Matrix
• Maximum Profit in Job Scheduling (HARD) — Array, Binary Search, Dynamic Programming, Sorting
• Search Suggestions System (MEDIUM) — Array, String, Binary Search, Trie, Sorting, Heap (Priority Queue)
• Koko Eating Bananas (MEDIUM) — Array, Binary Search
• Design File System (MEDIUM) — Hash Table, String, Design, Trie
• Most Profit Assigning Work (MEDIUM) — Array, Two Pointers, Binary Search, Greedy, Sorting
• Check if One String Swap Can Make Strings Equal (EASY) — Hash Table, String, Counting
• Shortest Distance from All Buildings (HARD) — Array, Breadth-First Search, Matrix
• Single-Threaded CPU (MEDIUM) — Array, Sorting, Heap (Priority Queue)
• Minimum Number of Steps to Make Two Strings Anagram (MEDIUM) — Hash Table, String, Counting
• Find K Closest Elements (MEDIUM) — Array, Two Pointers, Binary Search, Sliding Window, Sorting, Heap (Priority Queue)
• Next Greater Element III (MEDIUM) — Math, Two Pointers, String
• Buddy Strings (EASY) — Hash Table, String
• Design In-Memory File System (HARD) — Hash Table, String, Design, Trie, Sorting
• Find Nearest Point That Has the Same X or Y Coordinate (EASY) — Array
• Basic Calculator III (HARD) — Math, String, Stack, Recursion
• Making A Large Island (HARD) — Array, Depth-First Search, Breadth-First Search, Union Find, Matrix
• Count Sub Islands (MEDIUM) — Array, Depth-First Search, Breadth-First Search, Union Find, Matrix
• Asteroid Collision (MEDIUM) — Array, Stack, Simulation
• Count Nodes With the Highest Score (MEDIUM) — Array, Tree, Depth-First Search, Binary Tree
• Serialize and Deserialize Binary Tree (HARD) — String, Tree, Depth-First Search, Breadth-First Search, Design, Binary Tree
• Basic Calculator II (MEDIUM) — Math, String, Stack
• Count All Valid Pickup and Delivery Options (HARD) — Math, Dynamic Programming, Combinatorics
• Best Meeting Point (HARD) — Array, Math, Sorting, Matrix
• Course Schedule II (MEDIUM) — Depth-First Search, Breadth-First Search, Graph, Topological Sort
• Vertical Order Traversal of a Binary Tree (HARD) — Hash Table, Tree, Depth-First Search, Breadth-First Search, Sorting, Binary Tree
• Immediate Food Delivery II (MEDIUM) — Database
• Immediate Food Delivery I (EASY) — Database
• Implement Trie (Prefix Tree) (MEDIUM) — Hash Table, String, Design, Trie
• Two Sum (EASY) — Array, Hash Table
• Interval List Intersections (MEDIUM) — Array, Two Pointers, Line Sweep
• Mice and Cheese (MEDIUM) — Array, Greedy, Sorting, Heap (Priority Queue)
• Subsequence With the Minimum Score (HARD) — Two Pointers, String, Binary Search
• Jump Game (MEDIUM) — Array, Dynamic Programming, Greedy
• Basic Calculator (HARD) — Math, String, Stack, Recursion
• Task Scheduler (MEDIUM) — Array, Hash Table, Greedy, Sorting, Heap (Priority Queue), Counting
• Largest Rectangle in Histogram (HARD) — Array, Stack, Monotonic Stack
• 01 Matrix (MEDIUM) — Array, Dynamic Programming, Breadth-First Search, Matrix
• Max Area of Island (MEDIUM) — Array, Depth-First Search, Breadth-First Search, Union Find, Matrix
• Next Permutation (MEDIUM) — Array, Two Pointers
• Word Search II (HARD) — Array, String, Backtracking, Trie, Matrix
• Longest Common Subsequence (MEDIUM) — String, Dynamic Programming
• Swim in Rising Water (HARD) — Array, Binary Search, Depth-First Search, Breadth-First Search, Union Find, Heap (Priority Queue), Matrix
• Minimum Size Subarray Sum (MEDIUM) — Array, Binary Search, Sliding Window, Prefix Sum
• Number of Visible People in a Queue (HARD) — Array, Stack, Monotonic Stack
• Design Add and Search Words Data Structure (MEDIUM) — String, Depth-First Search, Design, Trie
• Sudoku Solver (HARD) — Array, Hash Table, Backtracking, Matrix
• Jump Game II (MEDIUM) — Array, Dynamic Programming, Greedy