Breadth-First Search

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

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

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

Medium | Array, Breadth-First Search, Matrix

Hard | Hash Table, String, Backtracking, Stack, Breadth-First Search, Sorting

Medium | Hash Table, Tree, Depth-First Search, Breadth-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

Hard | Array, Breadth-First Search, Matrix

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

Medium | Array, Hash Table, String, Breadth-First Search

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

Hard | Array, Dynamic Programming, Backtracking, Breadth-First Search, Memoization, Matrix

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

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