| 102 | Binary Tree Level Order Traversal | Easy | breadth first search |
| 103 | Binary Tree Zigzag Level Order Traversal | Medium | breadth first search |
| 107 | Binary Tree Level Order Traversal II | Easy | breadth first search |
| 117 | Populating Next Right Pointers in Each Node II | Hard | breadth first search |
| 127 | Word Ladder | Medium | breadth first search |
| 130 | Surrounded Regions | Medium | breadth first search |
| 133 | Clone Graph | Medium | breadth first search |
| 207 | Course Schedule | Medium | breadth first search |
| 210 | Course Schedule II | Medium | breadth first search |
| 261 | Graph Valid Tree | Medium | breadth first search |
| 269 | Alien Dictionary | Hard | breadth first search |
| 286 | Walls and Gates | Medium | breadth first search |
| 310 | Minimum Height Trees | Medium | breadth first search |
| 317 | Shortest Distance from All Buildings | Hard | breadth first search |
| 433 | Minimum Genetic Mutation | Medium | breadth first search |
| 444 | Sequence Reconstruction | Medium | breadth first search |
| 490 | The Maze | Medium | breadth first search |
| 499 | The Maze III | Hard | breadth first search |
| 505 | The Maze II | Medium | breadth first search |
| 542 | 01 Matrix | Medium | breadth first search |
| 666 | Path Sum IV | Medium | breadth first search |
| 675 | Cut Off Trees for Golf Event | Hard | breadth first search |
| 742 | Closest Leaf in a Binary Tree | Medium | breadth first search |
| 743 | Network Delay Time | Medium | breadth first search |
| 752 | Open the Lock | Medium | breadth first search |
| 773 | Sliding Puzzle | Hard | breadth first search |
| 787 | Cheapest Flights Within K Stops | Medium | breadth first search |
| 815 | Bus Routes | Medium | breadth first search |
| 854 | K-Similar Strings | Hard | breadth first search |
| 864 | Shortest Path to Get All Keys | Hard | breadth first search |
| 882 | Reachable Nodes In Subdivided Graph | Medium | breadth first search |
| 886 | Possible Bipartition | Medium | breadth first search |
| 913 | Cat and Mouse | Hard | breadth first search |
| 934 | Shortest Bridge | Medium | breadth first search |
| 967 | Numbers With Same Consecutive Differences | Medium | breadth first search |
| 994 | Rotting Oranges | Easy | breadth first search |
| 1034 | Coloring A Border | Medium | breadth first search |
| 1036 | Escape a Large Maze | Hard | breadth first search |
| 1091 | Shortest Path in Binary Matrix | Medium | breadth first search |
| 1102 | Path With Maximum Minimum Value | Medium | breadth first search |
| 1129 | Shortest Path with Alternating Colors | Medium | breadth first search |
| 1136 | Parallel Courses | Medium | breadth first search |
| 1161 | Maximum Level Sum of a Binary Tree | Medium | breadth first search |
| 1162 | As Far from Land as Possible | Medium | breadth first search |
| 1203 | Sort Items by Groups Respecting Dependencies | Hard | breadth first search |
| 1210 | Minimum Moves to Reach Target with Rotations | Hard | breadth first search |
| 1215 | Stepping Numbers | Medium | breadth first search |
| 1245 | Tree Diameter | Medium | breadth first search |
| 1263 | Minimum Moves to Move a Box to Their Target Location | Hard | breadth first search |
| 1284 | Minimum Number of Flips to Convert Binary Matrix to Zero Matrix | Hard | breadth first search |
| 1291 | Sequential Digits | Medium | breadth first search |
| 1293 | Shortest Path in a Grid with Obstacles Elimination | Hard | breadth first search |
| 1298 | Maximum Candies You Can Get from Boxes | Hard | breadth first search |
| 1302 | Deepest Leaves Sum | Medium | breadth first search |
| 1306 | Jump Game III | Medium | breadth first search |
| 1311 | Get Watched Videos by Your Friends | Medium | breadth first search |
| 1345 | Jump Game IV | Hard | breadth first search |
| 1368 | Minimum Cost to Make at Least One Valid Path in a Grid | Hard | breadth first search |
| 1514 | Path with Maximum Probability | Medium | breadth first search |
| 1602 | Find Nearest Right Node in Binary Tree | Medium | breadth first search |
| 1609 | Even Odd Tree | Medium | breadth first search |
| 1625 | Lexicographically Smallest String After Applying Operations | Medium | breadth first search |
| 1654 | Minimum Jumps to Reach Home | Medium | breadth first search |
| 1660 | Correct a Binary Tree | Medium | breadth first search |
| 1728 | Cat and Mouse II | Hard | breadth first search |
| 1730 | Shortest Path to Get Food | Medium | breadth first search |
| 1765 | Map of Highest Peak | Medium | breadth first search |
| 1926 | Nearest Exit from Entrance in Maze | Medium | breadth first search |
| 1928 | Minimum Cost to Reach Destination in Time | Medium | breadth first search |
| 2039 | The Time When the Network Becomes Idle | Medium | breadth first search |
| 2045 | Second Minimum Time to Reach Destination | Medium | breadth first search |
| 2050 | Parallel Courses III | Medium | breadth first search |
| 2059 | Minimum Operations to Convert Number | Medium | breadth first search |
| 2115 | Find All Possible Recipes from Given Supplies | Medium | breadth first search |
| 2146 | K Highest Ranked Items Within a Price Range | Medium | breadth first search |
| 2258 | Escape the Spreading Fire | Hard | breadth first search |
| 2290 | Minimum Obstacle Removal to Reach Corner | Hard | breadth first search |
| 2316 | Count Unreachable Pairs of Nodes in an Undirected Graph | Medium | breadth first search |
| 2368 | Reachable Nodes With Restrictions | Medium | breadth first search |
| 2415 | Reverse Odd Levels of Binary Tree | Medium | breadth first search |
| 2471 | Minimum Number of Operations to Sort a Binary Tree by Level | Medium | breadth first search |
| 2492 | Minimum Score of a Path Between Two Cities | Medium | breadth first search |
| 2493 | Divide Nodes Into the Maximum Number of Groups | Medium | breadth first search |
| 2503 | Maximum Number of Points From Grid Queries | Hard | breadth first search |
| 2577 | Minimum Time to Visit a Cell In a Grid | Hard | breadth first search |
| 2583 | Kth Largest Sum in a Binary Tree | Medium | breadth first search |
| 2603 | Collect Coins in a Tree | Hard | breadth first search |
| 2612 | Minimum Reverse Operations | Hard | breadth first search |
| 2617 | Minimum Number of Visited Cells in a Grid | Hard | breadth first search |
| 2641 | Cousins in Binary Tree II | Medium | breadth first search |
| 2658 | Maximum Number of Fish in a Grid | Medium | breadth first search |
| 2685 | Count the Number of Complete Components | Medium | breadth first search |
| 2709 | Greatest Common Divisor Traversal | Hard | breadth first search |
| 2812 | Find the Safest Path in a Grid | Medium | breadth first search |
| 2814 | Minimum Time Takes to Reach Destination Without Drowning | Hard | breadth first search |
| 2852 | Sum of Remoteness of All Cells | Medium | breadth first search |
| 3157 | Find the Level of Tree with Minimum Sum | Medium | breadth first search |
| 3286 | Find a Safe Walk Through a Grid | Medium | breadth first search |
| 3373 | Maximize the Number of Target Nodes After Connecting Trees II | Hard | breadth first search |
| 3528 | Unit Conversion I | Medium | breadth first search |
| 3535 | Unit Conversion II | Medium | breadth first search |
| 3552 | Grid Teleportation Traversal | Medium | breadth first search |
| 3568 | Minimum Moves to Clean the Classroom | Medium | breadth first search |
| 3619 | Count Islands With Total Value Divisible by K | Medium | breadth first search |
| 3629 | Minimum Jumps to Reach End via Prime Teleportation | Medium | breadth first search |
| 3690 | Split and Merge Array Transformation | Medium | breadth first search |
| 3695 | Maximize Alternating Sum Using Swaps | Hard | breadth first search |
| 3786 | Total Sum of Interaction Cost in Tree Groups | Hard | breadth first search |
| 3787 | Find Diameter Endpoints of a Tree | Medium | breadth first search |
| 3820 | Pythagorean Distance Nodes in a Tree | Medium | breadth first search |
| 3831 | Median of a Binary Search Tree Level | Medium | breadth first search |
| 3902 | Zigzag Level Sum of Binary Tree | Hard | breadth first search |
| 3905 | Multi Source Flood Fill | Medium | breadth first search |
| 3923 | Minimum Generations to Target Point | Medium | breadth first search |
| 3991 | Sort Array Using Prefix Reversals | Medium | breadth first search |