Jump Game I

Try to solve the Jump Game problem.

We'll cover the following

Statement

In a single-player jump game, the player starts at one end of a series of squares, with the goal of reaching the last square.

At each turn, the player can take up to ss steps towards the last square, where ss is the value of the current square.

For example, if the value of the current square is 33, the player can take either 33 steps, or 22 steps, or 11 step in the direction of the last square. The player cannot move in the opposite direction, that is, away from the last square.

You have been tasked with writing a function to validate whether a player can win a given game or not.

You’ve been provided with the nums integer array, representing the series of squares. The player starts at the first index and, following the rules of the game, tries to reach the last index.

If the player can reach the last index, your function returns TRUE; otherwise, it returns FALSE.

Constraints:

  • 1≤1 \leq nums.length ≤103\leq 10^3
  • 0≤0 \leq nums[i] ≤103\leq 10^3

Examples

1 / 5

Understand the problem

Let’s take a moment to make sure you've correctly understood the problem. The quiz below helps you check if you're solving the correct problem:

Jump Game I

1

Can you reach the end of [1, 2, 3, 4, 5] if you start from the very first element?

A)

Yes

B)

No

Question 1 of 30 attempted

Figure it out!

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Sequence - Vertical
Drag and drop the cards to rearrange them in the correct order.
1
2
3
4
5

Try it yourself

Implement your solution in the following coding playground.

Press + to interact
JavaScript
usercode > main.js
export function jumpGame(nums){

    // Replace this placeholder return statement with your code

    return false

}
Jump Game