PRACTICE

Breadth-First Search Interview Questions

56 Breadth-First Search problems asked across FAANG and top tech companies. Approach hints, optimal solutions, and related problems.

Ready to try these in a real interview?

I'm Alex. I'll interview you on 2 problems like these at your level, ask follow-ups, and give you a scored report.

πŸ”’

to save your progress.

Companies

Topics

Breadth-First Search 56
994.Rotting Oranges
Breadth-First SearchMatrixQueue
Medium+5β–Ά Mock
200.Number of Islands
Depth-First SearchBreadth-First SearchMatrix
Medium+7β–Ά Mock
210.Course Schedule II
Depth-First SearchBreadth-First SearchGraph
Medium+3β–Ά Mock
207.Course Schedule
Depth-First SearchBreadth-First SearchGraph
Medium+4β–Ά Mock
102.Binary Tree Level Order Traversal
Breadth-First SearchTree
Medium+4β–Ά Mock
104.Maximum Depth of Binary Tree
Depth-First SearchBreadth-First SearchTree
226.Invert Binary Tree
Depth-First SearchBreadth-First SearchTree
100.Same Tree
Depth-First SearchBreadth-First SearchTree
101.Symmetric Tree
Depth-First SearchBreadth-First SearchTree
322.Coin Change
Dynamic ProgrammingBreadth-First Search
Medium+4β–Ά Mock
269.Alien Dictionary
GraphTopological SortDepth-First Search
133.Clone Graph
Depth-First SearchBreadth-First SearchGraph
Medium+1β–Ά Mock
297.Serialize and Deserialize Binary Tree
Depth-First SearchBreadth-First SearchTree
399.Evaluate Division
ArrayStringDepth-First Search
2858.Minimum Edge Reversals So Every Node Is Reachable
Dynamic ProgrammingDepth-First SearchBreadth-First Search
721.Accounts Merge
ArrayHash TableString
2503.Maximum Number of Points from Grid Queries
ArrayTwo PointersBreadth-First Search
1091.Shortest Path in a Binary Matrix
ArrayBreadth-First SearchMatrix
103.Binary Tree Zigzag Level Order Traversal
TreeBreadth-First SearchBinary Tree
1197.Minimum Knight Moves
Breadth-First SearchHeuristic Search
127.Word Ladder
Hash TableStringBreadth-First Search
2477.Minimum Fuel Cost to Report to the Capital
TreeDepth-First SearchBreadth-First Search
Web Crawler Multithreaded
Depth-First SearchBreadth-First SearchConcurrency
797.All Paths From Source to Target
BacktrackingDepth-First SearchBreadth-First Search
314.Binary Tree Vertical Order Traversal
Hash TableTreeDepth-First Search
815.Bus Routes
ArrayHash TableBreadth-First Search
2204.Distance to a Cycle in Undirected Graph
Depth-First SearchBreadth-First SearchGraph
785.Is Graph Bipartite?
Depth-First SearchBreadth-First SearchUnion Find
802.Find Eventual Safe States
Depth-First SearchBreadth-First SearchGraph
2812.Find the Safest Path in a Grid
ArrayBinary SearchBreadth-First Search
743.Network Delay Time
Depth-First SearchBreadth-First SearchGraph
547.Number of Provinces
Depth-First SearchBreadth-First SearchUnion Find
827.Making A Large Island
ArrayDepth-First SearchBreadth-First Search
737.Sentence Similarity II
ArrayHash TableString
2039.The Time When the Network Becomes Idle
ArrayBreadth-First SearchGraph
1970.Last Day Where You Can Still Cross
ArrayBinary SearchDepth-First Search
1236.Web Crawler
StringDepth-First SearchBreadth-First Search
Populating Next Right Pointers in Each Node
Linked ListTreeDepth-First Search
Medium+1β–Ά Mock
199.Binary Tree Right Side View
TreeDepth-First SearchBreadth-First Search
364.Nested List Weight Sum II
StackDepth-First SearchBreadth-First Search
694.Number of Distinct Islands
Hash TableDepth-First SearchBreadth-First Search
749.Contain Virus
ArrayDepth-First SearchBreadth-First Search
773.Sliding Puzzle
ArrayDynamic ProgrammingBacktracking
787.Cheapest Flights Within K Stops
Dynamic ProgrammingDepth-First SearchBreadth-First Search
886.Possible Bipartition
Depth-First SearchBreadth-First SearchUnion Find
928.Minimize Malware Spread II
ArrayHash TableDepth-First Search
1087.Brace Expansion
StringBacktrackingBreadth-First Search
2101.Detonate the Maximum Bombs
ArrayMathDepth-First Search
2360.Longest Cycle in a Graph
Depth-First SearchBreadth-First SearchGraph

Practice with a Mock Interview

Solve these Breadth-First Search problems under real interview pressure with our AI interviewer.

Start Mock Interview β†’