Minimum Jumps

[Khxshx]

Problem: 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. In other words, if you are at nums[i], you can jump to any nums[i + j] where:

• 0 <= j <= nums[i] and
• i + j < n Return the minimum number of jumps to reach nums[n - 1]. The test cases are generated such that you can reach nums[n - 1].

Example 1: Input: nums = [2,3,1,1,4] Output: 2 Explanation: The minimum number of jumps to reach the last index is 2. Jump 1 step from index 0 to 1, then 3 steps to the last index.

Example 2: Input: nums = [2,3,0,1,4] Output: 2

Constraints:

• 1 <= nums.length <= 104
• 0 <= nums[i] <= 1000

[Nitya-Pasrija]

Hey @Khxshx @Parul-Mann Can you assign this issue to me?

[Harshita05104]

Assign this issue to me.

[Khxshx]

i can't finds you in this issue hence not able to give it to u

On Wed, Nov 16, 2022 at 8:17 PM Shreya Jain @.***> wrote:

@Khxshx https://github.com/Khxshx assign the issue to me I can solve this in best time and space complexity

— Reply to this email directly, view it on GitHub https://github.com/GDSC-IGDTUW-Autumn-of-Code-2022/ip-questions-2023/issues/9#issuecomment-1317137014, or unsubscribe https://github.com/notifications/unsubscribe-auth/ASRLISSM5U7OC7J6QISNMYDWITXXXANCNFSM6AAAAAAR2NZRFE . You are receiving this because you were mentioned.Message ID: <GDSC-IGDTUW-Autumn-of-Code-2022/ip-questions-2023/issues/9/1317137014@ github.com>

[BhavyaDevani]

@Khxshx pls assign this issue to me