Loading the journal
Day 12Medium
LeetCodeRelated practice
LeetCodeRelated practiceJump Game
Greedy Array TraversalSolved Nov 9, 2025
Go step by step: try it yourself before the video and the visual. Progress saves on this device.
Loading the journal
LeetCodeRelated practiceGreedy Array TraversalSolved Nov 9, 2025
Go step by step: try it yourself before the video and the visual. Progress saves on this device.
6 in the last 6 months
Community-reported company tags from leetcode-company-wise-problems (updated 2026-10-08). Bar shows how often each company asks it.
Problem
Given an array of non-negative integers nums, where nums[i] represents the maximum jump length from position i. Determine if you can reach the last index starting from the first index (index 0).
1Know these before you start
Concept video2Try it on paper
6Get it accepted
7Re-solve it from memory after
Reading the solution first feels like progress, but it makes the next similar problem — and the interview version — much harder, because you skipped the part where you figure it out. Give it an honest 20–30 minutes. Stuck? Re-read the pattern, watch the concept video, or try the brute force first.
Hidden: approach · solution code