NeetCode All · 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: 2
Category: Graphs
ℹ
Curated selection from NeetCode All
This sheet features 2 problems testing this technique. For the complete collection of problems and detailed algorithmic intuition, visit the BFS Shortest Path (Unweighted) Pattern Guide.
Featured Problems (2)
Explore More Patterns in NeetCode All
Track your progress across all 973 problems in this curriculum roadmap.