Breadth-First Search

Medium | Array, Hash Table, Breadth-First Search

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

Medium | Tree, Breadth-First Search

Medium | Dynamic Programming, Breadth-First Search, Memoization

Medium | Breadth-First Search, Graph Theory, Prefix Sum

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

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

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

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

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

Hard | Dynamic Programming, Depth-First Search, Breadth-First Search, Graph Theory

Medium | Array, Math, Depth-First Search, Breadth-First Search, Graph Theory, Geometry

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

Hard | Array, Breadth-First Search, Graph Theory, Heap (Priority Queue), Matrix, Shortest Path

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

Hard | Array, Dynamic Programming, Depth-First Search, Breadth-First Search, Graph Theory, Topological Sort, Memoization, Matrix

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

Medium | Array, Hash Table, Tree, Depth-First Search, Breadth-First Search, Union-Find, Graph Theory

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

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