GL
GrindLens
PatternsSheetsPricingQuestions
  1. Home
  2. /Sheets
  3. /NeetCode All
  4. /BFS Shortest Path (Unweighted)
←Back to NeetCode All
Curated IntersectionSheet: NeetCode AllPattern: BFS Shortest Path (Unweighted)

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)

1.Snakes and LaddersMedium
Solve↗
2.Word LadderHard
Solve↗

Explore More Patterns in NeetCode All

Track your progress across all 973 problems in this curriculum roadmap.

Back to NeetCode AllBFS Shortest Path (Unweighted) Pattern Guide
GL
GrindLens

Precision pattern analytics and curated sheet tracking for algorithmic coding interview preparation.

Quick lookup:⌘Kor/

Platform

  • Patterns→
  • Sheets→
  • Pricing→

Community

  • Feedback
  • Report a bug
  • X
  • LinkedIn

© 2026 GrindLens. LeetCode is a trademark of LeetCode. GrindLens is an independent analytics platform and is not affiliated with or endorsed by LeetCode.

Terms of ServicePrivacy Policy