DSAWiser

DSA question set · 170 questions

Breadth-First Search DSA Practice Questions

Explore 170 DSA questions in Breadth-First Search. Practice with DSAWiser’s code editor and visualizer.

Breadth-first searchQueue fundamentalsShortest pathsGrid traversalBinary treeGrouped level-order traversalNearest leaf / BFSLevel average BFSGraphsMaximum depth DFS/BFSPer-level maximaMirror symmetryDepth/parent cousin comparisonRight view BFSBinary treesN-ary treesStructural equalityDeepest-level aggregationSupporting exerciseOriented-leaf aggregationBottom-left BFS valueLeaf-sequence comparisonUniform leaf-depth predicateGraph coloringComplete-layout BFS predicateMulti-source BFSParent-aware distance BFS0-1 BFSGraph cloningMutation simulationState-space searchLayered relaxationSimulationPersistenceDial algorithmWeighted shortest pathsDijkstraTemporal networksGame theoryRetrograde analysisDynamic programmingBitmask DPBidirectional BFSPermutations

What’s in this set

The Breadth-First Search collection contains 170 problems: 50 basic, 41 easy, 59 medium, 20 hard. Choose a question at your current level, or follow the collection’s order below.

Topics in this collection include Breadth-first search, Queue fundamentals, Shortest paths, Grid traversal, Binary tree. Each question shows its own topics and difficulty so you can decide where to begin.

Practice with the code visualizer

  1. Open a question in the editor and read the statement, inputs, and expected output. Predict the result for a small example before writing code.
  2. Write a solution and run the examples. If a result differs from your prediction, reduce the input until you can follow each step.
  3. Step through your code in the visualizer. Use a breakpoint to inspect the state at a specific line, then compare it with your reasoning.

Questions in this set

170 total

Open a question in the editor to read its statement and examples. Sign in to practice.

  1. Initialize BFS Queue with Source NodeBreadth-first search · Queue fundamentalsBasic
  2. First Dequeue and Expansion in a 2-Node GraphBreadth-first search · Queue fundamentalsBasic
  3. Level 0 Traversal Order for an Isolated VertexBreadth-first search · Queue fundamentalsBasic
  4. BFS Traversal Sequence of a 2-Node GraphBreadth-first search · Queue fundamentalsBasic
  5. Immediate Neighbors as Level 1 NodesBreadth-first search · Queue fundamentalsBasic
  6. Queue After Expanding a Star CenterBreadth-first search · Queue fundamentalsBasic
  7. BFS Traversal of a 3-Node Line Starting at an EndpointBreadth-first search · Queue fundamentalsBasic
  8. BFS Traversal of a 3-Node Line Starting at the CenterBreadth-first search · Queue fundamentalsBasic
  9. BFS Traversal of a 3-Node Triangle GraphBreadth-first search · Queue fundamentalsBasic
  10. Check Visited Status of a Neighbor in a Triangle GraphBreadth-first search · Queue fundamentalsBasic
  11. BFS Distance from Source to ItselfBreadth-first search · Queue fundamentals · Shortest pathsBasic
  12. BFS Distance to an Immediate NeighborBreadth-first search · Queue fundamentals · Shortest pathsBasic
  13. BFS Distance in a 3-Node Linear PathBreadth-first search · Queue fundamentals · Shortest pathsBasic
  14. Count of Visited Nodes After First Step in a 2-Node GraphBreadth-first search · Queue fundamentalsBasic
  15. Queue Empty Check for BFS TerminationBreadth-first search · Queue fundamentalsBasic
  16. BFS Level-Order of a 3-Node Binary TreeBreadth-first search · Queue fundamentalsBasic
  17. Identify Level 2 Nodes in a 4-Node Linear PathBreadth-first search · Queue fundamentalsBasic
  18. Check if Target is Reachable at Level 1Breadth-first search · Queue fundamentalsBasic
  19. Maximum Queue Size in a StarBreadth-first search · Queue fundamentalsBasic
  20. First Dequeued Node in BFSBreadth-first search · Queue fundamentalsBasic
  21. Total BFS Levels in a 2-Node Connected GraphBreadth-first search · Queue fundamentalsBasic
  22. Total BFS Levels for an Isolated NodeBreadth-first search · Queue fundamentalsBasic
  23. Total BFS Levels in a 3-Node Linear PathBreadth-first search · Queue fundamentalsBasic
  24. Total BFS Levels in a 3-Node Triangle GraphBreadth-first search · Queue fundamentalsBasic
  25. Neighbor Enqueue Decision via Visited FilterBreadth-first search · Queue fundamentalsBasic
  26. Parent Node Assignment During Neighbor ExpansionBreadth-first search · Queue fundamentalsBasic
  27. Default Parent Value for the BFS Source NodeBreadth-first search · Queue fundamentalsBasic
  28. BFS Path from Source to Neighbor in a 2-Node GraphBreadth-first search · Queue fundamentalsBasic
  29. BFS Path in a 3-Node Linear PathBreadth-first search · Queue fundamentalsBasic
  30. Neighbor Level Propagation FormulaBreadth-first search · Queue fundamentalsBasic
  31. Current Level Node Count SnapshotBreadth-first search · Queue fundamentalsBasic
  32. Same-Level Check in a 3-Node Star GraphBreadth-first search · Queue fundamentalsBasic
  33. Same-Level Check in a 3-Node Linear PathBreadth-first search · Queue fundamentalsBasic
  34. Total BFS Tree Edges for N Connected VerticesBreadth-first search · Queue fundamentalsBasic
  35. Front and Back of Queue for Level 1 NodesBreadth-first search · Queue fundamentalsBasic
  36. BFS Traversal of a 4-Node Cycle GraphBreadth-first search · Queue fundamentalsBasic
  37. BFS Shortest Distance Across a 4-Node CycleBreadth-first search · Queue fundamentals · Shortest pathsBasic
  38. Level 1 Nodes in a StarBreadth-first search · Queue fundamentalsBasic
  39. Count of Visited Vertices in a Disconnected 3-Node GraphBreadth-first search · Queue fundamentalsBasic
  40. Target Reachability Check in a Disconnected GraphBreadth-first search · Queue fundamentalsBasic
  41. Unreachable Vertex Distance ConventionBreadth-first search · Queue fundamentals · Shortest pathsBasic
  42. In-Bounds Orthogonal Neighbors in a 2D GridBreadth-first search · Queue fundamentalsBasic
  43. Initial Queue State for Grid BFSBreadth-first search · Queue fundamentalsBasic
  44. Grid BFS Distance to Orthogonally Adjacent CellBreadth-first search · Queue fundamentals · Shortest pathsBasic
  45. Corner-to-Corner Distance in an Open 2x2 GridBreadth-first search · Queue fundamentals · Shortest pathsBasic
  46. 2D Visited Grid InitializationBreadth-first search · Queue fundamentalsBasic
  47. Grid Cell Obstacle and Visited FilterBreadth-first search · Queue fundamentals · Grid traversalBasic
  48. Initializing BFS Distance ArrayBreadth-first search · Queue fundamentals · Shortest pathsBasic
  49. Single-Step BFS Frontier ExpansionBreadth-first search · Queue fundamentalsBasic
  50. Total Unvisited Vertices After BFS CompletionBreadth-first search · Queue fundamentalsBasic
  51. Binary Tree Level Order TraversalBinary tree · Grouped level-order traversalEasy
  52. Minimum Depth of Binary TreeBinary tree · Nearest leaf / BFSEasy
  53. Average of Binary Tree Levels as Fixed DecimalsBinary tree · Level average BFSEasy
  54. Flood Fill on 2D GridBreadth-first search · Grid traversalEasy
  55. Find if Path Exists in GraphBreadth-first search · GraphsEasy
  56. Maximum Depth of Binary TreeBinary tree · Maximum depth DFS/BFSEasy
  57. Find Largest Value in Each Tree RowBinary tree · Per-level maximaEasy
  58. Symmetric TreeBinary tree · Mirror symmetryEasy
  59. Cousins in Binary TreeBinary tree · Depth/parent cousin comparisonEasy
  60. Binary Tree Right Side ViewBinary tree · Right view BFSEasy
  61. Binary Tree Bottom-Up Level Order TraversalBreadth-first search · Binary treesEasy
  62. N-ary Tree Level Order TraversalBreadth-first search · N-ary treesEasy
  63. Same TreeBinary tree · Structural equalityEasy
  64. Deepest Leaves SumBinary tree · Deepest-level aggregationEasy
  65. Shortest Path in an Unweighted GraphBreadth-first search · Graphs · Shortest pathsEasy
  66. Island Perimeter via BFSBreadth-first search · Grid traversalEasy
  67. Number of Connected Components in an Undirected GraphBreadth-first search · GraphsEasy
  68. Binary Tree Left Side ViewBreadth-first search · Binary treesEasy
  69. Minimum Steps in an Open 2D GridSupporting exerciseEasy
  70. Count Nodes at a Target Depth LevelBreadth-first search · Binary treesEasy
  71. Find All Nodes Reachable Within K StepsBreadth-first search · GraphsEasy
  72. Sum of Values at Each Tree LevelBreadth-first search · Binary treesEasy
  73. Single-Source Shortest Distances via BFSBreadth-first search · Graphs · Shortest pathsEasy
  74. Shortest Path Reconstruction via Parent PointersBreadth-first search · Graphs · Shortest pathsEasy
  75. Maximum Number of Real Nodes at a Tree LevelBreadth-first search · Binary treesEasy
  76. Leaf Nodes Collected in Level-OrderBreadth-first search · Binary treesEasy
  77. Single-Step Rotting Oranges SpreadBreadth-first search · Grid traversalEasy
  78. Sum of Left LeavesBinary tree · Oriented-leaf aggregationEasy
  79. Shortest Distance to a Target Value in an Unweighted GraphBreadth-first search · Graphs · Shortest pathsEasy
  80. Compare Node Depths in an N-ary Tree via BFSBreadth-first search · N-ary treesEasy
  81. Collect All Nodes at Exact Distance K from RootBreadth-first search · Binary trees · Shortest pathsEasy
  82. Find Bottom Left Tree ValueBinary tree · Bottom-left BFS valueEasy
  83. Leaf-Similar TreesBinary tree · Leaf-sequence comparisonEasy
  84. Minimum Steps to Reach End of 1D Array with ObstaclesBreadth-first searchEasy
  85. Level-Wise Max-Min Difference in Binary TreeBreadth-first search · Binary treesEasy
  86. Count Vertices at Even vs Odd Distance from SourceBreadth-first search · Graphs · Shortest pathsEasy
  87. Find Center of a Star GraphSupporting exercise · GraphsEasy
  88. Level-Order Successor in Binary TreeBreadth-first search · Binary treesEasy
  89. Check if All Leaves are at Same LevelBinary tree · Uniform leaf-depth predicateEasy
  90. Check if Move is Legal in Reversi via Directional RaysSupporting exercise · Grid traversalEasy
  91. Check if Graph is Bipartite via BFS 2-ColoringBreadth-first search · Graphs · Graph coloringMedium
  92. Graph Valid Tree Verification via BFSBreadth-first search · GraphsMedium
  93. Check Completeness of a Binary TreeBinary tree · Complete-layout BFS predicateEasy
  94. Distance to Nearest Zero in 2D Binary MatrixBreadth-first search · Grid traversal · Shortest paths · Multi-source BFSMedium
  95. Maximum Area of an Island via BFSBreadth-first search · Grid traversalMedium
  96. Detect Odd-Length Cycle via BFSBreadth-first search · Graphs · Graph coloringMedium
  97. Count Number of Islands in 2D Binary GridBreadth-first search · Grid traversalMedium
  98. Minimum Edge Reallocations to Connect NetworkBreadth-first search · GraphsMedium
  99. Minimum Steps to Reach Zero in Jump ArrayBreadth-first searchMedium
  100. Count Enclosed Water Cells in GridBreadth-first search · Grid traversalMedium
  101. Diameter of an Unweighted Tree via Double BFSBreadth-first search · GraphsMedium
  102. Rotting Oranges via Multi-Source BFSBreadth-first search · Grid traversal · Multi-source BFSMedium
  103. Shortest Clear Path in Binary MatrixBreadth-first search · Grid traversal · Shortest pathsMedium
  104. Word Ladder Shortest TransformationBreadth-first search · Shortest pathsMedium
  105. Snakes and LaddersBreadth-first search · Grid traversalMedium
  106. Shortest BridgeBreadth-first search · Grid traversal · Shortest pathsMedium
  107. Open the LockBreadth-first searchMedium
  108. Course Schedule II via Kahn's BFS AlgorithmBreadth-first searchMedium
  109. Shortest Path to Get FoodBreadth-first search · Grid traversal · Shortest pathsMedium
  110. Minimum Knight MovesBreadth-first searchMedium
  111. As Far from Land as PossibleBreadth-first search · Grid traversalMedium
  112. Shortest Path with Alternating ColorsBreadth-first search · Shortest pathsMedium
  113. Jump Game III Reachability CheckBreadth-first searchMedium
  114. Minimum Genetic MutationBreadth-first searchMedium
  115. All Nodes Distance K in Binary TreeBinary tree · Parent-aware distance BFSMedium
  116. Shortest Path in a Grid with Obstacles EliminationBreadth-first search · Grid traversal · Shortest pathsMedium
  117. Walls and Gates via Multi-Source BFSBreadth-first search · Grid traversal · Multi-source BFSMedium
  118. Surrounded RegionsBreadth-first search · Grid traversalMedium
  119. Number of EnclavesBreadth-first search · Grid traversalMedium
  120. Minimum Operations to Sort a Binary Tree by LevelBreadth-first search · Binary treesMedium
  121. Shortest Path in 0-1 Weighted Graph via Deque BFSBreadth-first search · Graphs · Shortest paths · 0-1 BFSMedium
  122. Clone Graph with Independent Mutation QueriesBreadth-first search · Graphs · Graph cloning · Mutation simulationMedium
  123. Bus Routes: Minimum Buses BoardedBreadth-first searchMedium
  124. Shortest Cycle in an Undirected GraphBreadth-first search · Graphs · Shortest pathsMedium
  125. Sliding Puzzle on a 2 by 3 BoardBreadth-first search · Grid traversal · State-space searchMedium
  126. Cheapest Flights Within K StopsSupporting exercise · Graphs · Layered relaxationMedium
  127. Pacific Atlantic Water FlowBreadth-first search · Grid traversalMedium
  128. Jump Game IV with Same-Value TeleportationBreadth-first searchMedium
  129. Bipartite Component 2-Partitioning via BFSBreadth-first search · Graphs · Graph coloringMedium
  130. Detonate the Maximum BombsBreadth-first searchMedium
  131. Reorder Routes to Make All Paths Lead to City ZeroBreadth-first search · GraphsMedium
  132. Jump Game VII with Frontier PruningBreadth-first searchMedium
  133. Web Crawler Same-Domain ExplorationBreadth-first search · GraphsMedium
  134. Minimum Multiplications to Reach EndBreadth-first searchMedium
  135. Closest Node to Given Two NodesBreadth-first search · GraphsMedium
  136. Nearest Exit from Entrance in MazeBreadth-first search · Grid traversalMedium
  137. Minimum Operations to Convert NumberBreadth-first searchMedium
  138. Immediate Escape from Spreading FireBreadth-first search · Grid traversal · Multi-source BFSMedium
  139. Minimum Jumps on a Circular GraphBreadth-first search · Shortest pathsMedium
  140. Shortest Path with One Free Edge DiscountBreadth-first search · Graphs · Shortest paths · 0-1 BFSMedium
  141. Minimum Number of Flips to Convert Binary Matrix to Zero MatrixBreadth-first search · Grid traversalMedium
  142. Shortest Path in a Grid with Teleportation PortalsBreadth-first search · Grid traversal · Shortest pathsMedium
  143. Count Shortest Paths in an Unweighted GraphBreadth-first search · Graphs · Shortest pathsMedium
  144. Direction-Switching Push/Pull BFS SimulationBreadth-first search · Graphs · SimulationMedium
  145. Undirected BFS with Two-Level Frontier FilteringBreadth-first search · Graphs · SimulationMedium
  146. Fully Persistent BFS Session ManagerBreadth-first search · Simulation · PersistenceMedium
  147. 64-Bit Frontier-Mask BFSBreadth-first search · Graphs · SimulationMedium
  148. Bulk-Synchronous Parallel (BSP) Pregel-Style Distributed BFSBreadth-first search · Graphs · SimulationMedium
  149. Dial's Multi-Bucket Circular Queue BFS for Bounded Edge WeightsBreadth-first search · Graphs · Dial algorithm · Weighted shortest pathsMedium
  150. Earliest Arrival with Departure WindowsSupporting exercise · Graphs · Dijkstra · Temporal networksMedium
  151. Shortest Path to Get All KeysBreadth-first search · Grid traversal · Shortest paths · State-space searchHard
  152. Word Ladder II (All Shortest Transformation Sequences)Breadth-first search · Shortest pathsHard
  153. Shortest Distance from All BuildingsBreadth-first search · Grid traversal · Shortest pathsHard
  154. Minimum Moves to Move a Box to Their Target LocationBreadth-first search · Grid traversalHard
  155. Minimum Cost to Make at Least One Valid Path in a GridBreadth-first search · Grid traversal · 0-1 BFSHard
  156. Shortest Path Visiting All NodesBreadth-first search · Graphs · Shortest pathsHard
  157. Cut Off Trees for Golf EventBreadth-first search · Grid traversalHard
  158. Minimum Reverse OperationsBreadth-first search · Binary treesHard
  159. Escape a Large MazeBreadth-first searchHard
  160. Minimum Moves to Reach Target with RotationsBreadth-first search · Grid traversalHard
  161. Minimum Jumps to Reach HomeBreadth-first search · Shortest pathsHard
  162. K-Similar Strings via Pruned State-Space BFSBreadth-first searchHard
  163. Race Car Minimum InstructionsBreadth-first search · State-space searchHard
  164. Cat and Mouse Game via Retrograde BFSBreadth-first search · Graphs · Game theory · Retrograde analysisHard
  165. Shortest Superstring Length via Bitmask Dynamic ProgrammingSupporting exercise · Shortest paths · State-space search · Dynamic programming · Bitmask DPHard
  166. Contain Virus Simulation via Frontier BFSBreadth-first search · Grid traversalHard
  167. Making a Large Island via Multi-Component BFSBreadth-first search · Grid traversalHard
  168. Level-Synchronous Work-Stealing BFS SimulationBreadth-first search · SimulationHard
  169. Retrograde BFS with Min-Max Move Counts on Finite GamesBreadth-first search · Graphs · Game theory · Retrograde analysisHard
  170. Bidirectional Asymmetric Frontier Balancing on Permutation Cayley GraphsBreadth-first search · Bidirectional BFS · PermutationsHard