Depth-First Search

Medium | Array, Depth-First Search, Breadth-First Search, Union-Find, Matrix

Easy | Tree, Depth-First Search, Binary Tree

Medium | Tree, Depth-First Search, Binary Tree

Hard | String, Tree, Depth-First Search, Binary Tree

Hard | Array, Hash Table, Depth-First Search, Breadth-First Search

Medium | Tree, Depth-First Search, Binary Search Tree, Binary Tree

Medium | Depth-First Search, Breadth-First Search, Graph Theory

Medium | Tree, Depth-First Search, Binary Tree

Medium | Array, Hash Table, Tree, Depth-First Search, Binary Tree

Medium | Hash Table, Tree, Depth-First Search, Breadth-First Search, Binary Tree

Medium | Tree, Depth-First Search, Binary Tree

Medium | Tree, Depth-First Search, Breadth-First Search, Binary Tree

Medium | Array, Hash Table, String, Depth-First Search, Breadth-First Search, Union-Find, Sorting

Hard | Depth-First Search, Breadth-First Search, Graph Theory, Topological Sort

Medium | Array, String, Depth-First Search, Trie

Medium | Array, Depth-First Search, Breadth-First Search, Union-Find, Matrix

Medium | Hash Table, Tree, Depth-First Search, Breadth-First Search, Design, Binary Tree

Medium | Array, Hash Table, String, Depth-First Search, Breadth-First Search, Union-Find, Sorting

Easy | Array, Depth-First Search, Breadth-First Search, Matrix

Medium | Depth-First Search, Breadth-First Search, Graph Theory, Heap (Priority Queue), Shortest Path