Skip to the editor
JSGroundwork
JSGroundwork handwritten · web dev
←Back to Greedy algorithms

Ready to read

JSJavaScript⑂Git◎Interview prepΣDSA in JSSDSystem Design
More topics15›
</>HTML{ }CSS⚛ReactNNext.jsNeNest.jsTSTypeScriptNoNode.js🐳DockerDBSQL & Databases✓Testing🔒Web Security☁Cloud & DevOps◈GraphQL◆Redis☸Kubernetes
☰‹›
Description
All topics›JavaScript›Greedy algorithms

Jump Game II

advancedlayer I9 · Greedy algorithms5 tests

Same rules as Jump Game — from index i you may jump up to nums[i] steps forward — but now the end is guaranteed reachable. Return the minimum number of jumps needed to get from index 0 to the last index.

  • Zero jumps are needed if the array has one element
  • Target O(n) time — no BFS queue, no DP table needed
  • Think in terms of levels: everything reachable in exactly k jumps

Stuck?

All exercisesPlayground
1234567891011121314
loading the editor…

Nothing yet — hit Run and whatever you log shows up here.

Submit to see how you did.

⌘/Ctrl + Enter run⌘/Ctrl + S save⌘/Ctrl + / comment⌘/Ctrl + F find/replace⌘/Ctrl + D select next matchAlt + click multi-cursorTab indent · ⇧Tab outdentEsc leave fullscreen