Algorithm · Two Sigma · Medium
You are given an array nums and begin at position 0. The value stored at each position is the farthest distance you may jump forward from there. Based on the precise version requested by the interviewer, address one of these cases: Reachability (Jump Game I): decide whether the final position is reachable. Minimum jumps (Jump Game II): compute the fewest jumps required to arrive at the final position. Reach a zero (Jump Game III): with a supplied start index, position i…
Checking your access…