Breadth-First Search

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

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

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

Hard | Array, Breadth-First Search, Heap (Priority Queue), Matrix

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

Hard | String, Dynamic Programming, Stack, Breadth-First Search, Memoization

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

Hard | String, Dynamic Programming, Depth-First Search, Breadth-First Search

Medium | Array, Dynamic Programming, Breadth-First Search, Matrix

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

Easy | Tree, Depth-First Search, Breadth-First Search

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

Hard | Array, Depth-First Search, Breadth-First Search, Matrix, Simulation

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

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

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

Hard | Array, Bit Manipulation, Breadth-First Search, Matrix

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

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

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