knaxuslearn · build · ship

DoorDash · DSA

Every coding problem DoorDash has asked, most frequent first. Tick them off as you go; your ticks stay in this browser.

mostly asked
18
hard
7
done
0

18 of 18 problems

  1. 1Walls and Gates (opens LeetCode in a new tab)Array, Breadth-First Search, Matrix · at 8 companiesMediumFrequency 100
  2. 2Longest Increasing Path in a Matrix (opens LeetCode in a new tab)Array, Dynamic Programming, Depth-First Search · at 12 companiesHardFrequency 92
  3. 3Binary Tree Maximum Path Sum (opens LeetCode in a new tab)Dynamic Programming, Tree, Depth-First Search · at 16 companiesHardFrequency 89
  4. 4Search Suggestions System (opens LeetCode in a new tab)Array, String, Binary Search · at 10 companiesMediumFrequency 85
  5. 5Maximum Profit in Job Scheduling (opens LeetCode in a new tab)Array, Binary Search, Dynamic Programming · at 14 companiesHardFrequency 77
  6. 6Koko Eating Bananas (opens LeetCode in a new tab)Array, Binary Search · at 23 companiesMediumFrequency 76
  7. 7Design File System (opens LeetCode in a new tab)Hash Table, String, Design · at 7 companiesMediumFrequency 74
  8. 8Shortest Distance from All Buildings (opens LeetCode in a new tab)Array, Breadth-First Search, Matrix · at 8 companiesHardFrequency 72
  9. 9Single-Threaded CPU (opens LeetCode in a new tab)Array, Sorting, Heap (Priority Queue) · at 7 companiesMediumFrequency 71
  10. 10Design In-Memory File System (opens LeetCode in a new tab)Hash Table, String, Design · at 7 companiesHardFrequency 67
  11. 11Next Greater Element III (opens LeetCode in a new tab)Math, Two Pointers, String · at 9 companiesMediumFrequency 66
  12. 12Find K Closest Elements (opens LeetCode in a new tab)Array, Two Pointers, Binary Search · at 12 companiesMediumFrequency 66
  13. 13Most Profit Assigning Work (opens LeetCode in a new tab)Array, Two Pointers, Binary Search · at 4 companiesMediumFrequency 63
  14. 14Count Nodes With the Highest Score (opens LeetCode in a new tab)Array, Tree, Depth-First Search · at 1 companyMediumFrequency 60
  15. 15Minimum Number of Steps to Make Two Strings Anagram (opens LeetCode in a new tab)Hash Table, String, Counting · at 7 companiesMediumFrequency 60
  16. 16Basic Calculator III (opens LeetCode in a new tab)Math, String, Stack · at 9 companiesHardFrequency 57
  17. 17Making A Large Island (opens LeetCode in a new tab)Array, Depth-First Search, Breadth-First Search · at 10 companiesHardFrequency 57
  18. 18Check if One String Swap Can Make Strings Equal (opens LeetCode in a new tab)Hash Table, String, Counting · at 5 companiesEasyFrequency 57

Mostly asked is the top quarter of the company’s list by how often a problem is reported. We don’t refresh this data often enough to show the last 30 days or 6 months. Frequency is relative within one company: 100 is its most asked problem. At N companies counts the companies in DSA Atlas that ask the problem; use Also asked at to cut a long list down to the problems many companies share. Your ticks are saved in this browser only.

Credits

These lists are the work of two open GitHub projects. Thank you to their authors.

Problem text stays on LeetCode; we link to it. Frequencies are relative within a company.

Last synced