Breadth-First Search problems,
and the tell.
You need the shortest path in steps, or anything that spreads out one layer at a time. 157 problems in the catalogue carry this tag, from first-week easy to interview hard.
Free to start. Running and submitting a solution never costs credits.
How the pattern actually works.
One mechanism, and the mistake that costs people the problem.
The tell. You need the shortest path in steps, or anything that spreads out one layer at a time.
The mechanism. A queue, and a seen set. Everything one step away comes out before anything two steps away, so the first time you reach a node is by the shortest route.
What goes wrong. Using BFS for shortest path when the edges have different weights. That is Dijkstra, not BFS.
The ones asked most often.
By how often the catalogue records them being set, not by our opinion.
- Walls and GatesMediumasked at 7 companies
- Shortest Path in a Grid with Obstacles EliminationHardasked at 6 companies
- Number of Connected Components in an Undirected GraphMediumasked at 3 companies
- Find the Safest Path in a GridMediumasked at 2 companies
- As Far from Land as PossibleMediumasked at 2 companies
- Island PerimeterEasyasked at 1 companies
- Detonate the Maximum BombsMediumasked at 1 companies
- Find All Groups of FarmlandMediumasked at 1 companies
- Minimum Cost to Make at Least One Valid Path in a GridHardasked at 1 companies
- Minimum Number of Operations to Make X and Y EqualMediumasked at 1 companies
Read it, watch it, then solve it.
The order that makes a pattern stick.
Everything in the app, in one place.
Practice, interviews and the tools, all free to start. Swipe to see the rest.
DSA practice
Problems filed under the pattern that solves them, not a sheet.
352 problemsOpenCompany sets
Practise what one company actually asks, the week before the round.
463 companiesOpenCoding interview
Pick the role, write in a real editor, and answer while you type.
scored reportOpenMock interviews, spoken
You answer out loud, it follows up on what you said.
36 topicsOpenDatabase round
DBMS asked the way a panel asks it: indexes, joins, normal forms.
in Core CSOpenOOP round
Inheritance, polymorphism and the follow-up you never rehearse.
in Core CSOpenSystem design
How real systems are built, from the primitives to the AI stack.
27 chaptersOpenSQL practice
Real schemas, your query, the rows it returns, and an honest verdict.
39 questionsOpenAptitude
Quant, logical, verbal, DI and technical, timed like the real test.
280 questionsOpenOnline assessment
A clock, marks per question and hidden tests, like a company's judge.
37 papersOpenAlgorithm visualiser
Watch it run on your own input, one step at a time.
26 algorithmsOpenAI that helps, not solves
Hints one at a time, AI review before a mentor reads it.
100 free creditsOpenResume builder
Build it inside the app, next to the work you practised.
in the appOpenProgress and readiness
One score, and the axis you are weakest on.
tracked dailyOpen
Free to start: 100 AI credits when you sign up and 100 every month. Start free in the app
About breadth-first search problems.
Free to start, no card.
Start practisingHow do I know a problem is a breadth-first search problem?
You need the shortest path in steps, or anything that spreads out one layer at a time.
How many breadth-first search problems should I solve?
Enough to stop needing the hint, which is usually ten to fifteen across the levels, not the whole list. The catalogue tags 157, split roughly 15 easy, 100 medium and 42 hard in the sample we show, so work up rather than across.
What goes wrong most often in breadth-first search problems?
Using BFS for shortest path when the edges have different weights. That is Dijkstra, not BFS.
Is practising by pattern better than a problem sheet?
A sheet tells you what to solve. A pattern tells you why those problems sit together, which is the part that carries over to the problem you have not seen. That is why the app files every problem under its pattern.