Can You Reach the Last Index?
Company: Waymo
Role: Software Engineer
Category: Coding & Algorithms
Difficulty: medium
Interview Round: Onsite
You are given an array `nums` of non-negative integers.
You start at index `0`. From index `i`, you may jump to any index `j` such that `i < j <= i + nums[i]`.
Return `true` if there exists a sequence of jumps that reaches the last index of the array, and `false` otherwise.
Example:
- Input: `nums = [2, 3, 1, 0, 4]`
- Output: `true`
Explain the approach you would use and its time complexity.
Quick Answer: This question evaluates a candidate's understanding of array traversal and reachability in sequences of jumps, along with the ability to reason about algorithmic time and space complexity.