GL
GrindLens
PatternsSheetsPricingQuestions
  1. Home
  2. /Sheets
  3. /Striver A2Z
  4. /Bounded-Hop Shortest Path (Bellman-Ford Style)
←Back to Striver A2Z
Curated IntersectionSheet: Striver A2ZPattern: Bounded-Hop Shortest Path (Bellman-Ford Style)

Striver A2Z · Bounded-Hop Shortest Path (Bellman-Ford Style)

Relax edges for a limited number of rounds (bounding the number of hops/stops) rather than running unbounded Dijkstra, since the constraint makes plain Dijkstra unsound.

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 Bounded-Hop Shortest Path (Bellman-Ford Style) Pattern Guide.

Featured Problems (1)

1.Cheapest Flights Within K StopsMedium
Solve↗

Explore More Patterns in Striver A2Z

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

Back to Striver A2ZBounded-Hop Shortest Path (Bellman-Ford Style) 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