MEDIUM NC#123 Blind #26 Greedy
55. Jump Game
📖 Problem
You are given an integer array nums. You are initially positioned at nums[0]. Each element in the array represents your maximum jump length at that position. Return true if you can reach the last index of the array, or false otherwise.
🧠 Visual Learning Aid
1 Model the input into the right structure
2 Choose the core technique and invariant
3 Execute step-by-step with a sample
4 Validate complexity and edge cases
JS/TS Refreshers
- •Array methods (`push`, `pop`, `shift`, `slice`)
- •Object/Map/Set usage patterns
- •Function parameter and return typing
Logical Thinking Concepts
- •Define invariants before coding
- •Check edge cases first (`[]`, single element, duplicates)
- •Estimate time/space before implementation
- •Apply Greedy reasoning pattern
💡 Approach
- → Track maximum reachable index
- → If current index + nums[i] > max, can reach further
- → If we can reach beyond array, return true
- → Time: O(n), Space: O(1)
🧭 Prerequisites
🛠️ Hints & Pitfalls
Hints
- •Track maximum reachable index
- •If current index + nums[i] > max, can reach further
- •If we can reach beyond array, return true
Common Pitfalls
- •Time: O(n), Space: O(1)
🧪 Test Cases
Hidden tests on submit: 1
Test Case 1
Not run Input:
canJump([2,3,1,1,4]); Expected:
true Test Case 2
Not run Input:
canJump([3,2,1,0,4]); Expected:
false Test Case 3
Not run Input:
canJump([0]); Expected:
true 📝 Code Editor
📤 Output