solulubeta
Sign in
NeetCode 150 / Greedy
15.02 · Problem

Jump Game

Medium Greedy: track the farthest reach 1 video LC 55 Pro

This problem is part of solulu Pro

You start at index 0. nums[i] is the maximum jump length from index i. Return true if you can reach the last index.

Lifetime ₹1,999 ₹999 · Launch offer
Mark this problem as solved when you are finished.

Item 123 of 150 · updated 2026-10-12