Breadth-First Search

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

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

Medium | Array, Breadth-First Search, Matrix

Medium | Array, Breadth-First Search, Matrix

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

Medium | Array, Breadth-First Search, Graph Theory

Hard | Breadth-First Search, Graph Theory, Shortest Path

Medium | Array, Breadth-First Search

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

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

Hard | Array, Binary Search, Breadth-First Search, Matrix

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

Medium | Breadth-First Search, Graph Theory

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

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

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

Hard | Hash Table, String, Breadth-First Search

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