Skip to content

Topic: Depth-First Search

245 problems
TitleStatusDifficulty
Word Search—Medium
Binary Tree Inorder Traversal—Easy
Validate Binary Search Tree—Medium
Recover Binary Search Tree—Medium
Same Tree—Easy
Symmetric Tree—Easy
Maximum Depth of Binary Tree—Easy
Balanced Binary Tree—Easy
Minimum Depth of Binary Tree—Easy
Path Sum—Easy
Path Sum II—Medium
Flatten Binary Tree to Linked List—Medium
Populating Next Right Pointers in Each Node—Medium
Populating Next Right Pointers in Each Node II—Medium
Binary Tree Maximum Path Sum—Hard
Sum Root to Leaf Numbers—Medium
Surrounded Regions—Medium
Clone Graph—Medium
Binary Tree Preorder Traversal—Easy
Binary Tree Postorder Traversal—Easy
Binary Tree Right Side View—Medium
Number of Islands—Medium
Course Schedule—Medium
Course Schedule II—Medium
Design Add and Search Words Data Structure—Medium
Invert Binary Tree—Easy
Kth Smallest Element in a BST—Medium
Lowest Common Ancestor of a Binary Search Tree—Medium
Lowest Common Ancestor of a Binary Tree—Medium
Binary Tree Paths—Easy
Graph Valid Tree—Medium
Alien Dictionary—Hard
Serialize and Deserialize Binary Tree—Hard
Minimum Height Trees—Medium
Number of Connected Components in an Undirected Graph—Medium
Longest Increasing Path in a Matrix—Hard
Reconstruct Itinerary—Hard
House Robber III—Medium
Flatten Nested List Iteratorread—Medium
Water and Jug Problem—Medium
Mini Parserread—Medium
Lexicographical Numbersread—Medium
Longest Absolute File Path—Medium
Evaluate Division—Medium
Sum of Left Leaves—Easy
Pacific Atlantic Water Flow—Medium
Battleships in a Board—Medium
Flatten a Multilevel Doubly Linked List—Medium
Path Sum III—Medium
Serialize and Deserialize BSTread—Medium
Page 1 of 5