NeetCode 150 · BFS Shortest Path (Unweighted)
Standard BFS where each edge has equal weight, so the first time a node is reached is guaranteed shortest.
Sheet Problems: 1
Category: Graphs
ℹ
Curated selection from NeetCode 150
This sheet features 1 problem testing this technique. For the complete collection of problems and detailed algorithmic intuition, visit the BFS Shortest Path (Unweighted) Pattern Guide.
Featured Problems (1)
Explore More Patterns in NeetCode 150
Track your progress across all 150 problems in this curriculum roadmap.