Jump Game

Medium

greedyarraydynamic-programming

You start at index 0 of array nums, where nums[i] is your maximum jump length from position i. Return true if you can reach the last index.

Input: one line of space-separated non-negative integers. Output: true or false.

Example 1

Input:

2 3 1 1 4

Output:

true

0→1→4.

Example 2

Input:

3 2 1 0 4

Output:

false

Index 3 is a trap.

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

Medium

greedyarraydynamic-programming

You start at index 0 of array nums, where nums[i] is your maximum jump length from position i. Return true if you can reach the last index.

Input: one line of space-separated non-negative integers. Output: true or false.

Example 1

Input:

2 3 1 1 4

Output:

true

0→1→4.

Example 2

Input:

3 2 1 0 4

Output:

false

Index 3 is a trap.

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