Jump Game

#55
Medium
Dynamic Programming
O(n)
O(1)
Amazon
Microsoft
Google
View on LeetCode

Problem Description

You are given an integer array nums. You are initially positioned at the array's first index. Each element represents your maximum jump length. Return true if you can reach the last index.