Company: DoorDash
- 01 Matrix
- 3Sum
- 4Sum
- Asteroid Collision
- Basic Calculator II
- Basic Calculator III
- Basic Calculator
- Best Meeting Point
- Binary Tree Maximum Path Sum
- Binary Tree Vertical Order Traversal
- Brace Expansion
- Buddy Strings
- Check if One String Swap Can Make Strings Equal
- Count All Valid Pickup and Delivery Options
- Count Nodes With the Highest Score
- Count Sub Islands
- Counting Words With a Given Prefix
- Course Schedule II
- Design Add and Search Words Data Structure
- Design File System
- Design In-Memory File System
- Diameter of N-Ary Tree
- Find K Closest Elements
- Find Nearest Point That Has the Same X or Y Coordinate
- Find the Celebrity
- Group Anagrams
- Implement Trie II (Prefix Tree)
- Implement Trie (Prefix Tree)
- Insert Delete GetRandom O(1)
- Interval List Intersections
- Jump Game II
- Jump Game
- Koko Eating Bananas
- Largest Rectangle in Histogram
- LFU Cache
- Longest Common Subsequence
- Longest Increasing Path in a Matrix
- LRU Cache
- Making A Large Island
- Max Area of Island
- Maximum Gap
- Maximum Path Quality of a Graph
- Maximum Profit in Job Scheduling
- Merge k Sorted Lists
- Mice and Cheese
- Minimize Malware Spread
- Minimum Number of Steps to Make Two Strings Anagram
- Minimum Size Subarray Sum
- Most Profit Assigning Work
- Next Greater Element III
- Next Permutation
- Number of Islands
- Number of Provinces
- Number of Visible People in a Queue
- Search Suggestions System
- Serialize and Deserialize Binary Tree
- Shortest Distance from All Buildings
- Shortest Path to Get Food
- Single-Threaded CPU
- Subsequence With the Minimum Score
- Sudoku Solver
- Swim in Rising Water
- Task Scheduler II
- Task Scheduler
- Top K Frequent Elements
- Two Sum
- Vertical Order Traversal of a Binary Tree
- Walls and Gates
- Ways to Make a Fair Array
- Word Search II