Greedy Algorithms - Jump Game (Can Reach End?)
Given the following code snippet for the Jump Game problem, what is the return value when called with input [2,3,1,1,4]?
Given the following code snippet for the Jump Game problem, what is the return value when called with input [2,3,1,1,4]?
easy🧾 Code Trace Q3 of Q15
Step-by-Step Solution
Solution:
Step 1: Trace maxReach updates
Start maxReach=0; i=0 jump=2 -> maxReach=2; i=1 jump=3 -> maxReach=4 (>= last index 4)Step 2: Return True when maxReach >= last index
At i=1, maxReach reaches 4, so function returns True.Final Answer:
Option C -> Option CQuick Check:
maxReach reaches last index early -> True [OK]
Quick Trick: maxReach >= last index returns True early [OK]
Common Mistakes:
MISTAKES- Confusing index bounds
- Off-by-one errors in maxReach update
Trap Explanation:
PITFALL- Some think it returns False if not at last index immediately, but it returns True once reachable.
Interviewer Note:
CONTEXT- Tests ability to mentally execute greedy code on typical input.
Master "Jump Game (Can Reach End?)" in Greedy Algorithms
Want More Practice?
15+ quiz questions · All difficulty levels · Free
Free Signup - Practice All QuestionsMore Greedy Algorithms Quizzes