Greedy (BFS-like) — Minimum jumps to reach the last index
Jumps
0
Current (i)
0
Farthest
0
End
0
Click "Step" or "Play" to begin the greedy algorithm.
We scan left to right, tracking the farthest reachable index.
When we pass the current level boundary (end), we take a jump.