Codejeet
Blog
Tracker
System Design
Home
/
Companies
/
DoorDash
/
Depth-First Search
DoorDash Depth-First Search Questions
18 depth-first search problems asked at DoorDash interviews
Easy (1)
Medium (8)
Hard (9)
Questions
Title
Difficulty
Acceptance
Frequency
Longest Increasing Path in a Matrix
Hard
56.3%
92.5%
Binary Tree Maximum Path Sum
Hard
42.0%
91.4%
Making A Large Island
Hard
56.3%
61.8%
Count Nodes With the Highest Score
Medium
52.5%
59.2%
Vertical Order Traversal of a Binary Tree
Hard
53.3%
50.7%
Course Schedule II
Medium
55.0%
50.7%
Max Area of Island
Medium
73.8%
48.4%
Serialize and Deserialize Binary Tree
Hard
60.4%
45.7%
Number of Islands
Medium
63.8%
38.6%
Minimize Malware Spread
Hard
43.0%
38.6%
Course Schedule
Medium
50.8%
38.6%
Swim in Rising Water
Hard
67.6%
33.6%
Count Sub Islands
Medium
73.0%
33.6%
Binary Tree Vertical Order Traversal
Medium
57.8%
33.6%
Similar String Groups
Hard
56.1%
33.6%
Design Add and Search Words Data Structure
Medium
48.2%
26.7%
Find Edges in Shortest Paths
Hard
46.4%
26.7%
Diameter of Binary Tree
Easy
65.1%
26.7%
Showing 18 questions
All DoorDash Questions
All Depth-First Search Questions