97 - Jump Game - Dynamic Programming approach 1

Pseudo code: // int[] nums int target = - 1; for (int i = - 1; i is greater than or equal to 0; i--) { if ((i nums[i]) is greater than or equal to target) { target = i; } } return target == 0; Github: Leetcode: