Jump Game II

Medium

greedyarraybfs

Same setup as Jump Game, but reaching the last index is guaranteed. Return the minimum number of jumps needed.

Input: one line of space-separated non-negative integers. Output: the minimum jump count.

Example 1

Input:

2 3 1 1 4

Output:

0→1 then 1→4.

Example 2

Input:

2 3 0 1 4

Output:

Run your code against the sample tests, or Submit to run the full suite.

Medium

greedyarraybfs

Same setup as Jump Game, but reaching the last index is guaranteed. Return the minimum number of jumps needed.

Input: one line of space-separated non-negative integers. Output: the minimum jump count.

Example 1

Input:

2 3 1 1 4

Output:

0→1 then 1→4.

Example 2

Input:

2 3 0 1 4

Output:

Run your code against the sample tests, or Submit to run the full suite.