# Breadth-First Search

- [126     Word Ladder II](/oj-practices/chapter1/breadth-first-search/126-word-ladder-ii.md)
- [127     Word Ladder](/oj-practices/chapter1/breadth-first-search/127-word-ladder.md)
- [130     Surrounded Regions](/oj-practices/chapter1/breadth-first-search/130-surrounded-regions.md)
- [133     Clone Graph](/oj-practices/chapter1/breadth-first-search/133-clone-graph.md)
- [200     Number of Islands](/oj-practices/chapter1/breadth-first-search/200-number-of-islands.md)
- [261     Graph Valid Tree](/oj-practices/chapter1/breadth-first-search/261-graph-valid-tree.md)
- [279     Perfect Squares](/oj-practices/chapter1/breadth-first-search/279-perfect-squares.md)
- [286     Walls and Gates](/oj-practices/chapter1/breadth-first-search/286-walls-and-gates.md)
- [301     Remove Invalid Parentheses](/oj-practices/chapter1/breadth-first-search/301-remove-invalid-parentheses.md)
- [310     Minimum Height Trees](/oj-practices/chapter1/breadth-first-search/310-minimum-height-trees.md)
- [317     Shortest Distance from All Buildings](/oj-practices/chapter1/breadth-first-search/317-shortest-distance-from-all-buildings.md)
- [323     Number of Connected Components in an Undirected Graph](/oj-practices/chapter1/breadth-first-search/323-number-of-connected-components-in-an-undirected-graph.md)
- [365 Water and Jug Problem](/oj-practices/chapter1/breadth-first-search/365-water-and-jug-problem.md)
- [397 Integer Replacement](/oj-practices/chapter1/breadth-first-search/397-integer-replacement.md)
- [407     Trapping Rain Water II](/oj-practices/chapter1/breadth-first-search/407-trapping-rain-water-ii.md)
- [417     Pacific Atlantic Water Flow](/oj-practices/chapter1/breadth-first-search/417-pacific-atlantic-water-flow.md)
- [429     N-ary Tree Level Order Traversal](/oj-practices/chapter1/breadth-first-search/429-n-ary-tree-level-order-traversal.md)
- [433 Minimum Genetic Mutation](/oj-practices/chapter1/breadth-first-search/433-minimum-genetic-mutation.md)
- [490     The Maze](/oj-practices/chapter1/breadth-first-search/490-the-maze.md)
- [499     The Maze III](/oj-practices/chapter1/breadth-first-search/499-the-maze-iii.md)
- [505     The Maze II](/oj-practices/chapter1/breadth-first-search/505-the-maze-ii.md)
- [529     Minesweeper](/oj-practices/chapter1/breadth-first-search/529-minesweeper.md)
- [542     01 Matrix](/oj-practices/chapter1/breadth-first-search/542-01-matrix.md)
- [675     Cut Off Trees for Golf Event](/oj-practices/chapter1/breadth-first-search/675-cut-off-trees-for-golf-event.md)
- [690     Employee Importance](/oj-practices/chapter1/breadth-first-search/690-employee-importance.md)
- [743     Network Delay Time](/oj-practices/chapter1/breadth-first-search/743-network-delay-time.md)
- [752     Open the Lock](/oj-practices/chapter1/breadth-first-search/752-open-the-lock.md)
- [773     Sliding Puzzle](/oj-practices/chapter1/breadth-first-search/773-sliding-puzzle.md)
- [785     Is Graph Bipartite?](/oj-practices/chapter1/breadth-first-search/785-is-graph-bipartite.md)
- [787     Cheapest Flights Within K Stops](/oj-practices/chapter1/breadth-first-search/787-cheapest-flights-within-k-stops.md)
- [815     Bus Routes](/oj-practices/chapter1/breadth-first-search/815-bus-routes.md)
- [818 Race Car](/oj-practices/chapter1/breadth-first-search/818-race-car.md)
- [847     Shortest Path Visiting All Nodes](/oj-practices/chapter1/breadth-first-search/847-shortest-path-visiting-all-nodes.md)
- [854 K-Similar Strings](/oj-practices/chapter1/breadth-first-search/854-k-similar-strings.md)
- [864     Shortest Path to Get All Keys](/oj-practices/chapter1/breadth-first-search/864-shortest-path-to-get-all-keys.md)
- [886 Possible Bipartition](/oj-practices/chapter1/breadth-first-search/886-possible-bipartition.md)
- [909 Snakes and Ladders](/oj-practices/chapter1/breadth-first-search/909-snakes-and-ladders.md)
- [913     Cat and Mouse](/oj-practices/chapter1/breadth-first-search/913-cat-and-mouse.md)
- [934     Shortest Bridge](/oj-practices/chapter1/breadth-first-search/934-shortest-bridge.md)