•PRACTICE

DSA Question Tracker & Breakdowns

56 problems tagged Breadth-First Search with full breakdowns.

433problems
32companies
39topics
3languages each
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
Easy+4▶ Mock
226.Invert Binary Tree
Depth-First SearchBreadth-First SearchTree
Easy+1▶ Mock
100.Same Tree
Depth-First SearchBreadth-First SearchTree
Easy+2▶ Mock
101.Symmetric Tree
Depth-First SearchBreadth-First SearchTree
Easy+1▶ Mock
322.Coin Change
Dynamic ProgrammingBreadth-First Search
Medium+4▶ Mock
269.Alien Dictionary
GraphTopological SortDepth-First Search
Hard+2▶ Mock
133.Clone Graph
Depth-First SearchBreadth-First SearchGraph
Medium+1▶ Mock
297.Serialize and Deserialize Binary Tree
Depth-First SearchBreadth-First SearchTree
Hard+4▶ Mock
399.Evaluate Division
ArrayStringDepth-First Search
Medium▶ Mock
2858.Minimum Edge Reversals So Every Node Is Reachable
Dynamic ProgrammingDepth-First SearchBreadth-First Search
721.Accounts Merge
ArrayHash TableString
Medium▶ Mock
2503.Maximum Number of Points from Grid Queries
ArrayTwo PointersBreadth-First Search
1091.Shortest Path in a Binary Matrix
ArrayBreadth-First SearchMatrix
Medium▶ Mock
103.Binary Tree Zigzag Level Order Traversal
TreeBreadth-First SearchBinary Tree
Medium▶ Mock
1197.Minimum Knight Moves
Breadth-First SearchHeuristic Search
Medium▶ Mock
127.Word Ladder
Hash TableStringBreadth-First Search
2477.Minimum Fuel Cost to Report to the Capital
TreeDepth-First SearchBreadth-First Search
Medium▶ Mock
Web Crawler Multithreaded
Depth-First SearchBreadth-First SearchConcurrency
Medium▶ Mock
797.All Paths From Source to Target
BacktrackingDepth-First SearchBreadth-First Search
Medium▶ Mock
314.Binary Tree Vertical Order Traversal
Hash TableTreeDepth-First Search
Medium▶ Mock
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
Medium▶ Mock
802.Find Eventual Safe States
Depth-First SearchBreadth-First SearchGraph
Medium▶ Mock
2812.Find the Safest Path in a Grid
ArrayBinary SearchBreadth-First Search
Medium▶ Mock
743.Network Delay Time
Depth-First SearchBreadth-First SearchGraph
Medium▶ Mock
547.Number of Provinces
Depth-First SearchBreadth-First SearchUnion Find
Medium▶ Mock
827.Making A Large Island
ArrayDepth-First SearchBreadth-First Search
737.Sentence Similarity II
ArrayHash TableString
Medium▶ Mock
2039.The Time When the Network Becomes Idle
ArrayBreadth-First SearchGraph
Medium▶ Mock
1970.Last Day Where You Can Still Cross
ArrayBinary SearchDepth-First Search
428.Serialize and Deserialize N-ary Tree
StringTreeDepth-First Search
987.Vertical Order Traversal of a Binary Tree
Hash TableTreeDepth-First Search
1236.Web Crawler
StringDepth-First SearchBreadth-First Search
Medium▶ Mock
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
Medium▶ Mock
364.Nested List Weight Sum II
StackDepth-First SearchBreadth-First Search
Medium▶ Mock
694.Number of Distinct Islands
Hash TableDepth-First SearchBreadth-First Search
Medium▶ Mock
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
Medium▶ Mock
886.Possible Bipartition
Depth-First SearchBreadth-First SearchUnion Find
Medium▶ Mock
928.Minimize Malware Spread II
ArrayHash TableDepth-First Search
1087.Brace Expansion
StringBacktrackingBreadth-First Search
Medium▶ Mock
1202.Smallest String With Swaps
ArrayHash TableString
Medium▶ Mock
1298.Maximum Candies You Can Get from Boxes
ArrayBreadth-First SearchGraph
2101.Detonate the Maximum Bombs
ArrayMathDepth-First Search
Medium▶ Mock
2360.Longest Cycle in a Graph
Depth-First SearchBreadth-First SearchGraph

Practice with a Mock Interview

Solve these problems under real interview pressure with our AI interviewer.

Start Mock Interview →