DoorDash SDE Interview Question 2024 March | Greedy | on-campus

Question 1 Problem Statement You are given a 0-indexed array of integers nums of length n. You are initially positioned at nums[0]. Each element nums[i] represents the maximum length of a forward jump from index i. Return the minimum number of jumps to reach nums[n-1]. The test cases are generated such that you can always reach nums[n-1]. Constraints 1 <= nums.length <= 104 0 <= nums[i] <= 1000 The answer is guaranteed to exist Examples Example 1: Input: nums = ...