# Breadth First Search

- [126 Word Ladder II](https://protegejj.gitbook.io/algorithm-practice/leetcode/breadth-first-search/126-word-ladder-ii.md)
- [127 Word Ladder](https://protegejj.gitbook.io/algorithm-practice/leetcode/breadth-first-search/127-word-ladder.md)
- [130 Surrounded Regions](https://protegejj.gitbook.io/algorithm-practice/leetcode/breadth-first-search/130-surrounded-regions.md)
- [279 Perfect Squares](https://protegejj.gitbook.io/algorithm-practice/leetcode/breadth-first-search/279-perfect-squares.md)
- [286 Walls and Gates](https://protegejj.gitbook.io/algorithm-practice/leetcode/breadth-first-search/286-walls-and-gates.md)
- [317 Shortest Distance from All Buildings](https://protegejj.gitbook.io/algorithm-practice/leetcode/breadth-first-search/317-shortest-distance-from-all-buildings.md)
- [397 Integer Replacement](https://protegejj.gitbook.io/algorithm-practice/leetcode/breadth-first-search/397-integer-replacement.md)
- [407 Trapping Rain Water II](https://protegejj.gitbook.io/algorithm-practice/leetcode/breadth-first-search/407-trapping-rain-water-ii.md)
- [433 Minimum Genetic Mutation](https://protegejj.gitbook.io/algorithm-practice/leetcode/breadth-first-search/433-minimum-genetic-mutation.md)
- [675 Cut Off Trees for Golf Event](https://protegejj.gitbook.io/algorithm-practice/leetcode/breadth-first-search/675-cut-off-trees-for-golf-event.md)
- [743 Network Delay Time](https://protegejj.gitbook.io/algorithm-practice/leetcode/breadth-first-search/743-network-delay-time.md)
- [752 Open the Lock](https://protegejj.gitbook.io/algorithm-practice/leetcode/breadth-first-search/753-open-the-lock.md)
- [773 Sliding Puzzle](https://protegejj.gitbook.io/algorithm-practice/leetcode/breadth-first-search/773-sliding-puzzle.md)
- [787 Cheapest Flights Within K Stops](https://protegejj.gitbook.io/algorithm-practice/leetcode/breadth-first-search/787-cheapest-flights-within-k-stops.md)


---

# Agent Instructions: Querying This Documentation

If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question.

Perform an HTTP GET request on the current page URL with the `ask` query parameter:

```
GET https://protegejj.gitbook.io/algorithm-practice/leetcode/breadth-first-search.md?ask=<question>
```

The question should be specific, self-contained, and written in natural language.
The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.

Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.