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
- Open a question in the editor and read the statement, inputs, and expected output. Predict the result for a small example before writing code.
- Write a solution and run the examples. If a result differs from your prediction, reduce the input until you can follow each step.
- 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 totalOpen a question in the editor to read its statement and examples. Sign in to practice.
- Initialize BFS Queue with Source NodeBreadth-first search · Queue fundamentalsBasic
- First Dequeue and Expansion in a 2-Node GraphBreadth-first search · Queue fundamentalsBasic
- Level 0 Traversal Order for an Isolated VertexBreadth-first search · Queue fundamentalsBasic
- BFS Traversal Sequence of a 2-Node GraphBreadth-first search · Queue fundamentalsBasic
- Immediate Neighbors as Level 1 NodesBreadth-first search · Queue fundamentalsBasic
- Queue After Expanding a Star CenterBreadth-first search · Queue fundamentalsBasic
- BFS Traversal of a 3-Node Line Starting at an EndpointBreadth-first search · Queue fundamentalsBasic
- BFS Traversal of a 3-Node Line Starting at the CenterBreadth-first search · Queue fundamentalsBasic
- BFS Traversal of a 3-Node Triangle GraphBreadth-first search · Queue fundamentalsBasic
- Check Visited Status of a Neighbor in a Triangle GraphBreadth-first search · Queue fundamentalsBasic
- BFS Distance from Source to ItselfBreadth-first search · Queue fundamentals · Shortest pathsBasic
- BFS Distance to an Immediate NeighborBreadth-first search · Queue fundamentals · Shortest pathsBasic
- BFS Distance in a 3-Node Linear PathBreadth-first search · Queue fundamentals · Shortest pathsBasic
- Count of Visited Nodes After First Step in a 2-Node GraphBreadth-first search · Queue fundamentalsBasic
- Queue Empty Check for BFS TerminationBreadth-first search · Queue fundamentalsBasic
- BFS Level-Order of a 3-Node Binary TreeBreadth-first search · Queue fundamentalsBasic
- Identify Level 2 Nodes in a 4-Node Linear PathBreadth-first search · Queue fundamentalsBasic
- Check if Target is Reachable at Level 1Breadth-first search · Queue fundamentalsBasic
- Maximum Queue Size in a StarBreadth-first search · Queue fundamentalsBasic
- First Dequeued Node in BFSBreadth-first search · Queue fundamentalsBasic
- Total BFS Levels in a 2-Node Connected GraphBreadth-first search · Queue fundamentalsBasic
- Total BFS Levels for an Isolated NodeBreadth-first search · Queue fundamentalsBasic
- Total BFS Levels in a 3-Node Linear PathBreadth-first search · Queue fundamentalsBasic
- Total BFS Levels in a 3-Node Triangle GraphBreadth-first search · Queue fundamentalsBasic
- Neighbor Enqueue Decision via Visited FilterBreadth-first search · Queue fundamentalsBasic
- Parent Node Assignment During Neighbor ExpansionBreadth-first search · Queue fundamentalsBasic
- Default Parent Value for the BFS Source NodeBreadth-first search · Queue fundamentalsBasic
- BFS Path from Source to Neighbor in a 2-Node GraphBreadth-first search · Queue fundamentalsBasic
- BFS Path in a 3-Node Linear PathBreadth-first search · Queue fundamentalsBasic
- Neighbor Level Propagation FormulaBreadth-first search · Queue fundamentalsBasic
- Current Level Node Count SnapshotBreadth-first search · Queue fundamentalsBasic
- Same-Level Check in a 3-Node Star GraphBreadth-first search · Queue fundamentalsBasic
- Same-Level Check in a 3-Node Linear PathBreadth-first search · Queue fundamentalsBasic
- Total BFS Tree Edges for N Connected VerticesBreadth-first search · Queue fundamentalsBasic
- Front and Back of Queue for Level 1 NodesBreadth-first search · Queue fundamentalsBasic
- BFS Traversal of a 4-Node Cycle GraphBreadth-first search · Queue fundamentalsBasic
- BFS Shortest Distance Across a 4-Node CycleBreadth-first search · Queue fundamentals · Shortest pathsBasic
- Level 1 Nodes in a StarBreadth-first search · Queue fundamentalsBasic
- Count of Visited Vertices in a Disconnected 3-Node GraphBreadth-first search · Queue fundamentalsBasic
- Target Reachability Check in a Disconnected GraphBreadth-first search · Queue fundamentalsBasic
- Unreachable Vertex Distance ConventionBreadth-first search · Queue fundamentals · Shortest pathsBasic
- In-Bounds Orthogonal Neighbors in a 2D GridBreadth-first search · Queue fundamentalsBasic
- Initial Queue State for Grid BFSBreadth-first search · Queue fundamentalsBasic
- Grid BFS Distance to Orthogonally Adjacent CellBreadth-first search · Queue fundamentals · Shortest pathsBasic
- Corner-to-Corner Distance in an Open 2x2 GridBreadth-first search · Queue fundamentals · Shortest pathsBasic
- 2D Visited Grid InitializationBreadth-first search · Queue fundamentalsBasic
- Grid Cell Obstacle and Visited FilterBreadth-first search · Queue fundamentals · Grid traversalBasic
- Initializing BFS Distance ArrayBreadth-first search · Queue fundamentals · Shortest pathsBasic
- Single-Step BFS Frontier ExpansionBreadth-first search · Queue fundamentalsBasic
- Total Unvisited Vertices After BFS CompletionBreadth-first search · Queue fundamentalsBasic
- Binary Tree Level Order TraversalBinary tree · Grouped level-order traversalEasy
- Minimum Depth of Binary TreeBinary tree · Nearest leaf / BFSEasy
- Average of Binary Tree Levels as Fixed DecimalsBinary tree · Level average BFSEasy
- Flood Fill on 2D GridBreadth-first search · Grid traversalEasy
- Find if Path Exists in GraphBreadth-first search · GraphsEasy
- Maximum Depth of Binary TreeBinary tree · Maximum depth DFS/BFSEasy
- Find Largest Value in Each Tree RowBinary tree · Per-level maximaEasy
- Symmetric TreeBinary tree · Mirror symmetryEasy
- Cousins in Binary TreeBinary tree · Depth/parent cousin comparisonEasy
- Binary Tree Right Side ViewBinary tree · Right view BFSEasy
- Binary Tree Bottom-Up Level Order TraversalBreadth-first search · Binary treesEasy
- N-ary Tree Level Order TraversalBreadth-first search · N-ary treesEasy
- Same TreeBinary tree · Structural equalityEasy
- Deepest Leaves SumBinary tree · Deepest-level aggregationEasy
- Shortest Path in an Unweighted GraphBreadth-first search · Graphs · Shortest pathsEasy
- Island Perimeter via BFSBreadth-first search · Grid traversalEasy
- Number of Connected Components in an Undirected GraphBreadth-first search · GraphsEasy
- Binary Tree Left Side ViewBreadth-first search · Binary treesEasy
- Minimum Steps in an Open 2D GridSupporting exerciseEasy
- Count Nodes at a Target Depth LevelBreadth-first search · Binary treesEasy
- Find All Nodes Reachable Within K StepsBreadth-first search · GraphsEasy
- Sum of Values at Each Tree LevelBreadth-first search · Binary treesEasy
- Single-Source Shortest Distances via BFSBreadth-first search · Graphs · Shortest pathsEasy
- Shortest Path Reconstruction via Parent PointersBreadth-first search · Graphs · Shortest pathsEasy
- Maximum Number of Real Nodes at a Tree LevelBreadth-first search · Binary treesEasy
- Leaf Nodes Collected in Level-OrderBreadth-first search · Binary treesEasy
- Single-Step Rotting Oranges SpreadBreadth-first search · Grid traversalEasy
- Sum of Left LeavesBinary tree · Oriented-leaf aggregationEasy
- Shortest Distance to a Target Value in an Unweighted GraphBreadth-first search · Graphs · Shortest pathsEasy
- Compare Node Depths in an N-ary Tree via BFSBreadth-first search · N-ary treesEasy
- Collect All Nodes at Exact Distance K from RootBreadth-first search · Binary trees · Shortest pathsEasy
- Find Bottom Left Tree ValueBinary tree · Bottom-left BFS valueEasy
- Leaf-Similar TreesBinary tree · Leaf-sequence comparisonEasy
- Minimum Steps to Reach End of 1D Array with ObstaclesBreadth-first searchEasy
- Level-Wise Max-Min Difference in Binary TreeBreadth-first search · Binary treesEasy
- Count Vertices at Even vs Odd Distance from SourceBreadth-first search · Graphs · Shortest pathsEasy
- Find Center of a Star GraphSupporting exercise · GraphsEasy
- Level-Order Successor in Binary TreeBreadth-first search · Binary treesEasy
- Check if All Leaves are at Same LevelBinary tree · Uniform leaf-depth predicateEasy
- Check if Move is Legal in Reversi via Directional RaysSupporting exercise · Grid traversalEasy
- Check if Graph is Bipartite via BFS 2-ColoringBreadth-first search · Graphs · Graph coloringMedium
- Graph Valid Tree Verification via BFSBreadth-first search · GraphsMedium
- Check Completeness of a Binary TreeBinary tree · Complete-layout BFS predicateEasy
- Distance to Nearest Zero in 2D Binary MatrixBreadth-first search · Grid traversal · Shortest paths · Multi-source BFSMedium
- Maximum Area of an Island via BFSBreadth-first search · Grid traversalMedium
- Detect Odd-Length Cycle via BFSBreadth-first search · Graphs · Graph coloringMedium
- Count Number of Islands in 2D Binary GridBreadth-first search · Grid traversalMedium
- Minimum Edge Reallocations to Connect NetworkBreadth-first search · GraphsMedium
- Minimum Steps to Reach Zero in Jump ArrayBreadth-first searchMedium
- Count Enclosed Water Cells in GridBreadth-first search · Grid traversalMedium
- Diameter of an Unweighted Tree via Double BFSBreadth-first search · GraphsMedium
- Rotting Oranges via Multi-Source BFSBreadth-first search · Grid traversal · Multi-source BFSMedium
- Shortest Clear Path in Binary MatrixBreadth-first search · Grid traversal · Shortest pathsMedium
- Word Ladder Shortest TransformationBreadth-first search · Shortest pathsMedium
- Snakes and LaddersBreadth-first search · Grid traversalMedium
- Shortest BridgeBreadth-first search · Grid traversal · Shortest pathsMedium
- Open the LockBreadth-first searchMedium
- Course Schedule II via Kahn's BFS AlgorithmBreadth-first searchMedium
- Shortest Path to Get FoodBreadth-first search · Grid traversal · Shortest pathsMedium
- Minimum Knight MovesBreadth-first searchMedium
- As Far from Land as PossibleBreadth-first search · Grid traversalMedium
- Shortest Path with Alternating ColorsBreadth-first search · Shortest pathsMedium
- Jump Game III Reachability CheckBreadth-first searchMedium
- Minimum Genetic MutationBreadth-first searchMedium
- All Nodes Distance K in Binary TreeBinary tree · Parent-aware distance BFSMedium
- Shortest Path in a Grid with Obstacles EliminationBreadth-first search · Grid traversal · Shortest pathsMedium
- Walls and Gates via Multi-Source BFSBreadth-first search · Grid traversal · Multi-source BFSMedium
- Surrounded RegionsBreadth-first search · Grid traversalMedium
- Number of EnclavesBreadth-first search · Grid traversalMedium
- Minimum Operations to Sort a Binary Tree by LevelBreadth-first search · Binary treesMedium
- Shortest Path in 0-1 Weighted Graph via Deque BFSBreadth-first search · Graphs · Shortest paths · 0-1 BFSMedium
- Clone Graph with Independent Mutation QueriesBreadth-first search · Graphs · Graph cloning · Mutation simulationMedium
- Bus Routes: Minimum Buses BoardedBreadth-first searchMedium
- Shortest Cycle in an Undirected GraphBreadth-first search · Graphs · Shortest pathsMedium
- Sliding Puzzle on a 2 by 3 BoardBreadth-first search · Grid traversal · State-space searchMedium
- Cheapest Flights Within K StopsSupporting exercise · Graphs · Layered relaxationMedium
- Pacific Atlantic Water FlowBreadth-first search · Grid traversalMedium
- Jump Game IV with Same-Value TeleportationBreadth-first searchMedium
- Bipartite Component 2-Partitioning via BFSBreadth-first search · Graphs · Graph coloringMedium
- Detonate the Maximum BombsBreadth-first searchMedium
- Reorder Routes to Make All Paths Lead to City ZeroBreadth-first search · GraphsMedium
- Jump Game VII with Frontier PruningBreadth-first searchMedium
- Web Crawler Same-Domain ExplorationBreadth-first search · GraphsMedium
- Minimum Multiplications to Reach EndBreadth-first searchMedium
- Closest Node to Given Two NodesBreadth-first search · GraphsMedium
- Nearest Exit from Entrance in MazeBreadth-first search · Grid traversalMedium
- Minimum Operations to Convert NumberBreadth-first searchMedium
- Immediate Escape from Spreading FireBreadth-first search · Grid traversal · Multi-source BFSMedium
- Minimum Jumps on a Circular GraphBreadth-first search · Shortest pathsMedium
- Shortest Path with One Free Edge DiscountBreadth-first search · Graphs · Shortest paths · 0-1 BFSMedium
- Minimum Number of Flips to Convert Binary Matrix to Zero MatrixBreadth-first search · Grid traversalMedium
- Shortest Path in a Grid with Teleportation PortalsBreadth-first search · Grid traversal · Shortest pathsMedium
- Count Shortest Paths in an Unweighted GraphBreadth-first search · Graphs · Shortest pathsMedium
- Direction-Switching Push/Pull BFS SimulationBreadth-first search · Graphs · SimulationMedium
- Undirected BFS with Two-Level Frontier FilteringBreadth-first search · Graphs · SimulationMedium
- Fully Persistent BFS Session ManagerBreadth-first search · Simulation · PersistenceMedium
- 64-Bit Frontier-Mask BFSBreadth-first search · Graphs · SimulationMedium
- Bulk-Synchronous Parallel (BSP) Pregel-Style Distributed BFSBreadth-first search · Graphs · SimulationMedium
- Dial's Multi-Bucket Circular Queue BFS for Bounded Edge WeightsBreadth-first search · Graphs · Dial algorithm · Weighted shortest pathsMedium
- Earliest Arrival with Departure WindowsSupporting exercise · Graphs · Dijkstra · Temporal networksMedium
- Shortest Path to Get All KeysBreadth-first search · Grid traversal · Shortest paths · State-space searchHard
- Word Ladder II (All Shortest Transformation Sequences)Breadth-first search · Shortest pathsHard
- Shortest Distance from All BuildingsBreadth-first search · Grid traversal · Shortest pathsHard
- Minimum Moves to Move a Box to Their Target LocationBreadth-first search · Grid traversalHard
- Minimum Cost to Make at Least One Valid Path in a GridBreadth-first search · Grid traversal · 0-1 BFSHard
- Shortest Path Visiting All NodesBreadth-first search · Graphs · Shortest pathsHard
- Cut Off Trees for Golf EventBreadth-first search · Grid traversalHard
- Minimum Reverse OperationsBreadth-first search · Binary treesHard
- Escape a Large MazeBreadth-first searchHard
- Minimum Moves to Reach Target with RotationsBreadth-first search · Grid traversalHard
- Minimum Jumps to Reach HomeBreadth-first search · Shortest pathsHard
- K-Similar Strings via Pruned State-Space BFSBreadth-first searchHard
- Race Car Minimum InstructionsBreadth-first search · State-space searchHard
- Cat and Mouse Game via Retrograde BFSBreadth-first search · Graphs · Game theory · Retrograde analysisHard
- Shortest Superstring Length via Bitmask Dynamic ProgrammingSupporting exercise · Shortest paths · State-space search · Dynamic programming · Bitmask DPHard
- Contain Virus Simulation via Frontier BFSBreadth-first search · Grid traversalHard
- Making a Large Island via Multi-Component BFSBreadth-first search · Grid traversalHard
- Level-Synchronous Work-Stealing BFS SimulationBreadth-first search · SimulationHard
- Retrograde BFS with Min-Max Move Counts on Finite GamesBreadth-first search · Graphs · Game theory · Retrograde analysisHard
- Bidirectional Asymmetric Frontier Balancing on Permutation Cayley GraphsBreadth-first search · Bidirectional BFS · PermutationsHard