Same setup, but find the minimum number of jumps to reach the end. Guaranteed reachable.
Example: [2,3,1,1,4]. Minimum jumps: . Jump from to ( steps available), then jump from to .
This needs a more sophisticated greedy approach.
You cannot just track furthest.
You need to know when you are forced to jump.
Think BFS: each jump opens a new level of reachable positions.