search

aayushi-droid / Edabit-Solutions

Edabit Solutions using Cpp(C++)
MIT License
39 stars 154 forks source link

Jump Game - II #255

Closed byte-coding closed 3 years ago

byte-coding commented 3 years ago

Problem Link: https://leetcode.com/problems/jump-game-ii/

Given an array of non-negative integers, you are initially positioned at the first index of the array. Each element in the array represents your maximum jump length at that position. Your goal is to reach the last index in the minimum number of jumps.

Example: Input: [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. Note: You can assume that you can always reach the last index.

Problem Type: Hard

Gautam-Diwan commented 3 years ago

assign this to me @byte-coding

byte-coding commented 3 years ago

@aayushi-droid Can you please assign this issue to me? I am working on it.

prajwlr commented 3 years ago

Hi. I would love to contribute. Please assign it to me.

chiillax commented 3 years ago

Could you please assign me for this task ?