Depth-First Search

Hard | Array, Tree, Depth-First Search, Binary Indexed Tree, Segment Tree

Hard | Array, Binary Search, Dynamic Programming, Bit Manipulation, Tree, Depth-First Search

Medium | Array, Binary Search, Depth-First Search, Breadth-First Search, Union-Find, Heap (Priority Queue), Matrix

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

Hard | Depth-First Search, Breadth-First Search, Union-Find, Graph Theory, Sorting

Medium | Depth-First Search, Graph Theory

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

Hard | Depth-First Search, Graph Theory, Biconnected Component

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

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

Hard | Binary Search, Dynamic Programming, Bit Manipulation, Tree, Depth-First Search, Breadth-First Search, Design

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

Hard | Array, Depth-First Search, Breadth-First Search, Matrix, Strongly Connected Component

Medium | String, Depth-First Search, Breadth-First Search, Enumeration

Hard | Array, Math, Dynamic Programming, Tree, Depth-First Search, Graph Theory, Topological Sort, Combinatorics

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

Hard | Hash Table, Bit Manipulation, Tree, Depth-First Search

Hard | Array, Dynamic Programming, Bit Manipulation, Tree, Depth-First Search, Bitmask

Medium | Depth-First Search, Trie

Medium | Array, Depth-First Search, Matrix