BFS Problems
About 1 min
Graph BFS Problems
| Problem Number | Title | Solution | Tags | Difficulty |
|---|---|---|---|---|
| 0797 | All Paths From Source to Target | [[LeetCode XXXX]] | Depth-First Search, Breadth-First Search, Graph, Backtracking | Medium |
| 0286 | Walls and Gates | [[LeetCode XXXX]] | Breadth-First Search, Array, Matrix | Medium |
| 0200 | Number of Islands | [[LeetCode XXXX]] | Depth-First Search, Breadth-First Search, Union Find, Array, Matrix | Medium |
| 0752 | Open the Lock | [[LeetCode XXXX]] | Breadth-First Search, Array, Hash Table, String | Medium |
| 0279 | Perfect Squares | [[LeetCode XXXX]] | Breadth-First Search, Math, Dynamic Programming | Medium |
| 0133 | Clone Graph | [[LeetCode XXXX]] | Depth-First Search, Breadth-First Search, Graph, Hash Table | Medium |
| 0733 | Flood Fill | [[LeetCode XXXX]] | Depth-First Search, Breadth-First Search, Array, Matrix | Easy |
| 0542 | 01 Matrix | [[LeetCode XXXX]] | Breadth-First Search, Array, Dynamic Programming, Matrix | Medium |
| 0322 | Coin Change | [[LeetCode XXXX]] | Breadth-First Search, Array, Dynamic Programming | Medium |
| 0323 | Number of Connected Components in an Undirected Graph | [[LeetCode XXXX]] | Depth-First Search, Breadth-First Search, Union Find, Graph | Medium |
| 0199 | Binary Tree Right Side View | [[LeetCode XXXX]] | Tree, Depth-First Search, Breadth-First Search, Binary Tree | Medium |
| 0662 | Maximum Width of Binary Tree | [[LeetCode XXXX]] | Tree, Depth-First Search, Breadth-First Search, Binary Tree | Medium |
| 0958 | Check Completeness of a Binary Tree | [[LeetCode XXXX]] | Tree, Breadth-First Search, Binary Tree | Medium |
| 0572 | Subtree of Another Tree | Tree, Depth-First Search, Binary Tree, String Matching, Hash Function | Easy | |
| 0100 | Same Tree | [[LeetCode XXXX]] | Tree, Depth-First Search, Breadth-First Search, Binary Tree | Easy |
| 0111 | Minimum Depth of Binary Tree | [[LeetCode XXXX]] | Tree, Depth-First Search, Breadth-First Search, Binary Tree | Easy |