Skip to content

Files

Latest commit

 

History

History

Jump Game

Folders and files

NameName
Last commit message
Last commit date

parent directory

..
 
 
 
 

Jump Game

Given an array of non-negative integers, you are initially positioned at the first index of the array.

Each element in the array represents your maximum jump length at that position.

Determine if you are able to reach the last index.

For example: A = [2,3,1,1,4], return true.

A = [3,2,1,0,4], return false.

Subscribe to see which companies asked this question