Solution: Jump Game

Let's solve the Jump Game challenge using the Greedy pattern.

Statement

You are given an integer array nums, where each element represents the maximum number of steps you can move forward from that position. You always start at index 00 (the first element), and at each step, you may jump to any of the next positions within the range allowed by the current element’s value. Return TRUE if you can reach the last index, or FALSE otherwise.

Constraints:

  • 11 \leq nums.length 103\leq 10^3
  • 0
...