Skip to content

© 2026 uByte

Pricing Help Privacy Terms

Jump Gamemedium

Problems

1.Two Sum
2.Valid Parentheses
3.Contains Duplicate
4.Best Time to Buy and Sell Stock
5.Reverse String
6.Climbing Stairs
7.Missing Number
8.Single Number
9.Move Zeroes
10.Is Palindrome String
11.First Unique Character in a String
12.Majority Element
13.Plus One
14.Fibonacci Number
15.Valid Anagram
16.Roman to Integer
17.Max Consecutive Ones
18.Power of Two
19.Reverse Words in a String
20.Remove Duplicates from Sorted Array

1–20 of 114

114 problems

← Back to list·All languages →

Jump Game

medium

You are given an integer array `nums`. You are initially positioned at the **first index** and each element represents your maximum jump length from that position. Return `true` if you can reach the last index, or `false` otherwise. **Constraints:** - `1 <= nums.length <= 10⁴` - `0 <= nums[i] <= 10⁵` **Hint:** Track the farthest index you can reach at each step.

Examples

Example 1

Input: nums = [2,3,1,1,4]

Output: true

Jump 1 to index 1, then 3 to the last.

Example 2

Input: nums = [3,2,1,0,4]

Output: false

Always stuck at index 3.

← Prev Next →

1

2

3

4

5

6

7

8

9

10

11

💻

Click Run to execute your code

Or Submit to run against all hidden test cases

Jump Game — JavaScript Coding Problem

Difficulty: medium | Category: greedy

Problem Description

You are given an integer array `nums`. You are initially positioned at the **first index** and each element represents your maximum jump length from that position. Return `true` if you can reach the last index, or `false` otherwise. **Constraints:** - `1 <= nums.length <= 10⁴` - `0 <= nums[i] <= 10⁵` **Hint:** Track the farthest index you can reach at each step.

Examples

Example 1

Input: nums = [2,3,1,1,4]

Output: true

Explanation: Jump 1 to index 1, then 3 to the last.

Example 2

Input: nums = [3,2,1,0,4]

Output: false

Explanation: Always stuck at index 3.

← Back to JavaScript Problems · All Interview Prep Problems