Striver A2Z · 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 Striver A2Z
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 Striver A2Z
Track your progress across all 243 problems in this curriculum roadmap.