•PRACTICE

DSA Question Tracker & Breakdowns

73 problems tagged Depth-First Search with full breakdowns.

433problems
32companies
39topics
3languages each
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
Easy+4▶ Mock
226.Invert Binary Tree
Depth-First SearchBreadth-First SearchTree
Easy+1▶ Mock
100.Same Tree
Depth-First SearchBreadth-First SearchTree
Easy+2▶ Mock
101.Symmetric Tree
Depth-First SearchBreadth-First SearchTree
Easy+1▶ Mock
Design Add and Search Words Data Structure
TrieDepth-First SearchDesign
Medium+1▶ Mock
269.Alien Dictionary
GraphTopological SortDepth-First Search
Hard+2▶ Mock
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
Hard+4▶ Mock
341.Flatten Nested List Iterator
StackTreeDepth-First Search
Medium▶ Mock
79.Word Search
ArrayStringBacktracking
Medium+1▶ Mock
399.Evaluate Division
ArrayStringDepth-First Search
Medium▶ Mock
2858.Minimum Edge Reversals So Every Node Is Reachable
Dynamic ProgrammingDepth-First SearchBreadth-First Search
721.Accounts Merge
ArrayHash TableString
Medium▶ Mock
124.Binary Tree Maximum Path Sum
Dynamic ProgrammingTreeDepth-First Search
235.Lowest Common Ancestor of a Binary Search Tree
TreeDepth-First SearchBinary Search Tree
Medium▶ Mock
430.Flatten a Multilevel Doubly Linked List
Linked ListDepth-First SearchDoubly-Linked List
Medium▶ Mock
2477.Minimum Fuel Cost to Report to the Capital
TreeDepth-First SearchBreadth-First Search
Medium▶ Mock
Web Crawler Multithreaded
Depth-First SearchBreadth-First SearchConcurrency
Medium▶ Mock
797.All Paths From Source to Target
BacktrackingDepth-First SearchBreadth-First Search
Medium▶ Mock
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
Medium▶ Mock
2204.Distance to a Cycle in Undirected Graph
Depth-First SearchBreadth-First SearchGraph
337.House Robber III
Dynamic ProgrammingTreeDepth-First Search
Medium▶ Mock
785.Is Graph Bipartite?
Depth-First SearchBreadth-First SearchUnion Find
Medium▶ Mock
802.Find Eventual Safe States
Depth-First SearchBreadth-First SearchGraph
Medium▶ Mock
743.Network Delay Time
Depth-First SearchBreadth-First SearchGraph
Medium▶ Mock
547.Number of Provinces
Depth-First SearchBreadth-First SearchUnion Find
Medium▶ Mock
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
Medium▶ Mock
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
Medium▶ Mock
1676.Lowest Common Ancestor of a Binary Tree IV
Hash TableTreeDepth-First Search
Medium▶ Mock
332.Reconstruct Itinerary
ArrayStringDepth-First Search
428.Serialize and Deserialize N-ary Tree
StringTreeDepth-First Search
987.Vertical Order Traversal of a Binary Tree
Hash TableTreeDepth-First Search
1236.Web Crawler
StringDepth-First SearchBreadth-First Search
Medium▶ Mock
Design Add and Search Words Data Structure
StringDepth-First SearchDesign
Medium▶ Mock
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
Medium▶ Mock
257.Binary Tree Paths
StringBacktrackingTree
364.Nested List Weight Sum II
StackDepth-First SearchBreadth-First Search
Medium▶ Mock
437.Path Sum III
TreeDepth-First SearchBinary Tree
Medium▶ Mock
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
Medium▶ Mock
749.Contain Virus
ArrayDepth-First SearchBreadth-First Search
787.Cheapest Flights Within K Stops
Dynamic ProgrammingDepth-First SearchBreadth-First Search
Medium▶ Mock
851.Loud and Rich
ArrayDepth-First SearchGraph
Medium▶ Mock
886.Possible Bipartition
Depth-First SearchBreadth-First SearchUnion Find
Medium▶ Mock
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
Medium▶ Mock
1202.Smallest String With Swaps
ArrayHash TableString
Medium▶ Mock
1600.Throne Inheritance
Hash TableTreeDepth-First Search
Medium▶ Mock
2097.Valid Arrangement of Pairs
Depth-First SearchGraphEulerian Circuit
2101.Detonate the Maximum Bombs
ArrayMathDepth-First Search
Medium▶ Mock
2265.Count Nodes Equal to Average of Subtree
TreeDepth-First SearchBinary Tree
Medium▶ Mock
2360.Longest Cycle in a Graph
Depth-First SearchBreadth-First SearchGraph

Practice with a Mock Interview

Solve these problems under real interview pressure with our AI interviewer.

Start Mock Interview →