Minimum no. of Jumps to reach end of an array [Implementation in C++[SSOC]]

[AnubhaSharma2709]

Given an array of N integers arr[] where each element represents the maximum length of the jump that can be made forward from that element. This means if arr[i] = x, then we can jump any distance y such that y ≤ x. Find the minimum number of jumps to reach the end of the array (starting from the first element). If an element is 0, then you cannot move through that element.

Pls Assign this issue to me Under SSoC'23

[Daksh-Maru]

Please assign this to me. I would like to solve this problem.

[vivekpal24]

Can you Assign this to me I can solve this in three language in C, CPP and python

[Kumar-laxmi]

Please don't raise issues to solve LeetCode, gfg or hackerrank questions