Breadth-first search on graphs
Explore level by level with a queue and a visited set — shortest paths when every edge costs the same.
This lesson is part of Pro.
Free covers the C and Python courses, the first three DSA topics, the opening system design lessons and the beginner AI lessons, all with the full coach. Pro opens the rest of the library in the FollowtheDamnCode app.