You are given an integer array nums. You are initially positioned at the array's first index, and each element in the array represents your maximum jump length at that position.
Return true if you can reach the last index, or false otherwise.
We use analytics and advertising cookies to understand how the site is used and whether our ads on Facebook and Instagram work. They are set only if you accept. See our Privacy Policy for details.
You are given an integer array nums. You are initially positioned at the array's first index, and each element in the array represents your maximum jump length at that position.
Return true if you can reach the last index, or false otherwise.
A medium greedy problem, graded against 6 test cases (3 of them hidden).
Take the locally best option each step and prove it stays globally optimal.
Reach for it when you see: Interval scheduling, jump/reachability questions, or an optimisation with an obvious local choice.
More Greedy problems →Track the maximum reachable index. At each position, if we can reach it, update the maximum reach. If we can reach the end, return true.
The full reference solution in every supported language stays in the editor above - reveal it there once you have had a real attempt.
Read off this problem's own test suite, so these are the cases a submission actually has to survive.
These apply to the pattern as a whole, not just this problem.