Problem Statement
You are given an integer array nums. You are initially positioned at the array's first index, and each element in the array represents your maximum jump length at that position. Return true if you can reach the last index, or false otherwise.
Approach
Track the `maxReach`. Iterate through the array. If current index i > maxReach, we are stuck, return false. Update maxReach = max(maxReach, i + nums[i]). If maxReach >= last index, return true.
Time & Space Complexity
Time complexity is O(n). Space complexity is O(1).