PRACTICE

Depth-First Search Interview Questions

73 Depth-First Search problems asked across FAANG and top tech companies. Approach hints, optimal solutions, and related problems.

Ready to try these in a real interview?

I'm Alex. I'll interview you on 2 problems like these at your level, ask follow-ups, and give you a scored report.

πŸ”’

to save your progress.

Companies

Topics

Depth-First Search 73
200.Number of Islands
Depth-First SearchBreadth-First SearchMatrix
Medium+7β–Ά Mock
210.Course Schedule II
Depth-First SearchBreadth-First SearchGraph
Medium+3β–Ά Mock
207.Course Schedule
Depth-First SearchBreadth-First SearchGraph
Medium+4β–Ά Mock
98.Validate Binary Search Tree
Depth-First SearchBinary Search TreeTree
Medium+3β–Ά Mock
104.Maximum Depth of Binary Tree
Depth-First SearchBreadth-First SearchTree
226.Invert Binary Tree
Depth-First SearchBreadth-First SearchTree
100.Same Tree
Depth-First SearchBreadth-First SearchTree
101.Symmetric Tree
Depth-First SearchBreadth-First SearchTree
Design Add and Search Words Data Structure
TrieDepth-First SearchDesign
Medium+1β–Ά Mock
269.Alien Dictionary
GraphTopological SortDepth-First Search
230.Kth Smallest Element in a BST
Depth-First SearchBinary Search TreeTree
Medium+2β–Ά Mock
133.Clone Graph
Depth-First SearchBreadth-First SearchGraph
Medium+1β–Ά Mock
297.Serialize and Deserialize Binary Tree
Depth-First SearchBreadth-First SearchTree
341.Flatten Nested List Iterator
StackTreeDepth-First Search
79.Word Search
ArrayStringBacktracking
Medium+1β–Ά Mock
399.Evaluate Division
ArrayStringDepth-First Search
2858.Minimum Edge Reversals So Every Node Is Reachable
Dynamic ProgrammingDepth-First SearchBreadth-First Search
721.Accounts Merge
ArrayHash TableString
124.Binary Tree Maximum Path Sum
Dynamic ProgrammingTreeDepth-First Search
235.Lowest Common Ancestor of a Binary Search Tree
TreeDepth-First SearchBinary Search Tree
430.Flatten a Multilevel Doubly Linked List
Linked ListDepth-First SearchDoubly-Linked List
2477.Minimum Fuel Cost to Report to the Capital
TreeDepth-First SearchBreadth-First Search
Web Crawler Multithreaded
Depth-First SearchBreadth-First SearchConcurrency
797.All Paths From Source to Target
BacktrackingDepth-First SearchBreadth-First Search
94.Binary Tree Inorder Traversal
StackTreeDepth-First Search
144.Binary Tree Preorder Traversal
StackTreeDepth-First Search
314.Binary Tree Vertical Order Traversal
Hash TableTreeDepth-First Search
2204.Distance to a Cycle in Undirected Graph
Depth-First SearchBreadth-First SearchGraph
337.House Robber III
Dynamic ProgrammingTreeDepth-First Search
785.Is Graph Bipartite?
Depth-First SearchBreadth-First SearchUnion Find
802.Find Eventual Safe States
Depth-First SearchBreadth-First SearchGraph
743.Network Delay Time
Depth-First SearchBreadth-First SearchGraph
547.Number of Provinces
Depth-First SearchBreadth-First SearchUnion Find
827.Making A Large Island
ArrayDepth-First SearchBreadth-First Search
3367.Maximize Sum of Weights after Edge Removals
Dynamic ProgrammingTreeDepth-First Search
737.Sentence Similarity II
ArrayHash TableString
1970.Last Day Where You Can Still Cross
ArrayBinary SearchDepth-First Search
1644.Lowest Common Ancestor of a Binary Tree II
TreeDepth-First SearchBinary Tree
332.Reconstruct Itinerary
ArrayStringDepth-First Search
1236.Web Crawler
StringDepth-First SearchBreadth-First Search
Design Add and Search Words Data Structure
StringDepth-First SearchDesign
Populating Next Right Pointers in Each Node
Linked ListTreeDepth-First Search
Medium+1β–Ά Mock
110.Balanced Binary Tree
TreeDepth-First SearchBinary Tree
199.Binary Tree Right Side View
TreeDepth-First SearchBreadth-First Search
257.Binary Tree Paths
StringBacktrackingTree
364.Nested List Weight Sum II
StackDepth-First SearchBreadth-First Search
437.Path Sum III
TreeDepth-First SearchBinary Tree
543.Diameter of Binary Tree
TreeDepth-First SearchBinary Tree
642.Design Search Autocomplete System
StringDepth-First SearchDesign
694.Number of Distinct Islands
Hash TableDepth-First SearchBreadth-First Search
749.Contain Virus
ArrayDepth-First SearchBreadth-First Search
787.Cheapest Flights Within K Stops
Dynamic ProgrammingDepth-First SearchBreadth-First Search
851.Loud and Rich
ArrayDepth-First SearchGraph
886.Possible Bipartition
Depth-First SearchBreadth-First SearchUnion Find
928.Minimize Malware Spread II
ArrayHash TableDepth-First Search
968.Binary Tree Cameras
Dynamic ProgrammingTreeDepth-First Search
1145.Binary Tree Coloring Game
TreeDepth-First SearchBinary Tree
1600.Throne Inheritance
Hash TableTreeDepth-First Search
2097.Valid Arrangement of Pairs
Depth-First SearchGraphEulerian Circuit
2101.Detonate the Maximum Bombs
ArrayMathDepth-First Search
2265.Count Nodes Equal to Average of Subtree
TreeDepth-First SearchBinary Tree
2360.Longest Cycle in a Graph
Depth-First SearchBreadth-First SearchGraph

Practice with a Mock Interview

Solve these Depth-First Search problems under real interview pressure with our AI interviewer.

Start Mock Interview β†’