opensource/developer-roadmap
3
0
Fork 0
mirror of https://github.com/kamranahmedse/developer-roadmap.git synced 2026-10-29 17:44:52 +08:00
Code Issues Packages Projects Releases Wiki Activity
Files
b0102e77382bcbb6c22336bcf304fc9f080d8d47
developer-roadmap/roadmaps/leetcode/content/jump-game-ii@gJ1O1H12KoNejTV_q0dsf.md
T
Arik Chakma 274082fd77 feat: clean roadmap content and sync scripts (#10181) 
* refactor: clean to roadmap content

* refactor: move shared helpers into scripts/lib
2026-07-28 05:45:17 +06:00

815 B
Raw Blame History

Jump Game II

Given the same setup, find the minimum number of jumps to reach the last index. You greedily track the end of the current jump range and the furthest you can reach within it, incrementing the jump count when you exhaust the current range. This problem teaches you the two-range greedy technique, where you separate the current jump's boundary from the next one. Visit the question on the LeetCode website.

Visit the following resources to learn more:

Reference in New Issue View Git Blame Copy Permalink