Problem Statement
Pattern:
Solution
public boolean canJump(int[] nums) {
if(nums.length <= 1) return true;
int limit = nums[0];
for (int index = 0; index <= limit; index++) {
if (index == nums.length - 1) return true;
limit = Math.max(limit, index+nums[index]);
}
return false;
}