Given an array of integers where each element represents the max number of steps that can be made forward from that element. Write a function to return the minimum number of jumps to reach the end of the array (starting from the first element). If an element is 0, then cannot move through that element.

**Example:**

Input: arr[] = {1, 3, 5, 8, 9, 2, 6, 7, 6, 8, 9} Output: 3 (1-> 3 -> 8 ->9)

First element is 1, so can only go to 3. Second element is 3, so can make at most 3 steps eg to 5 or 8 or 9.

##
Recommended: Please solve it on “__PRACTICE__ ” first, before moving on to the solution.

__PRACTICE__**Method 1 (Naive Recursive Approach)**

A naive approach is to start from the first element and recursively call for all the elements reachable from first element. The minimum number of jumps to reach end from first can be calculated using minimum number of jumps needed to reach end from the elements reachable from first.

*minJumps(start, end) = Min ( minJumps(k, end) ) for all k reachable from start*

## Java

`// Javaprogram to find Minimum ` `// number of jumps to reach end ` `import` `java.util.*; ` `import` `java.io.*; ` ` ` `class` `GFG { ` ` ` `// Returns minimum number of ` ` ` `// jumps to reach arr[h] from arr[l] ` ` ` `static` `int` `minJumps(` `int` `arr[], ` `int` `l, ` `int` `h) ` ` ` `{ ` ` ` `// Base case: when source ` ` ` `// and destination are same ` ` ` `if` `(h == l) ` ` ` `return` `0` `; ` ` ` ` ` `// When nothing is reachable ` ` ` `// from the given source ` ` ` `if` `(arr[l] == ` `0` `) ` ` ` `return` `Integer.MAX_VALUE; ` ` ` ` ` `// Traverse through all the points ` ` ` `// reachable from arr[l]. Recursively ` ` ` `// get the minimum number of jumps ` ` ` `// needed to reach arr[h] from these ` ` ` `// reachable points. ` ` ` `int` `min = Integer.MAX_VALUE; ` ` ` `for` `(` `int` `i = l + ` `1` `; i <= h && i <= l + arr[l]; i++) { ` ` ` `int` `jumps = minJumps(arr, i, h); ` ` ` `if` `(jumps != Integer.MAX_VALUE && jumps + ` `1` `< min) ` ` ` `min = jumps + ` `1` `; ` ` ` `} ` ` ` `return` `min; ` ` ` `} ` ` ` ` ` `// Driver code ` ` ` `public` `static` `void` `main(String args[]) ` ` ` `{ ` ` ` `int` `arr[] = { ` `1` `, ` `3` `, ` `6` `, ` `3` `, ` `2` `, ` `3` `, ` `6` `, ` `8` `, ` `9` `, ` `5` `}; ` ` ` `int` `n = arr.length; ` ` ` `System.out.print(` `"Minimum number of jumps to reach end is "` ` ` `+ minJumps(arr, ` `0` `, n - ` `1` `)); ` ` ` `} ` `} ` ` ` `// This code is contributed by Sahil_Bansall ` |

*chevron_right*

*filter_none*

**Output:**

Minimum number of jumps to reach end is 4

**Method 2 (Dynamic Programming) **

In this method, we build a jumps[] array from left to right such that jumps[i] indicates the minimum number of jumps needed to reach arr[i] from arr[0]. Finally, we return jumps[n-1].

## Java

`// JAVA Code for Minimum number of jumps to reach end ` `class` `GFG { ` ` ` ` ` `private` `static` `int` `minJumps(` `int` `[] arr, ` `int` `n) ` ` ` `{ ` ` ` `int` `jumps[] = ` `new` `int` `[n]; ` `// jumps[n-1] will hold the ` ` ` `// result ` ` ` `int` `i, j; ` ` ` ` ` `if` `(n == ` `0` `|| arr[` `0` `] == ` `0` `) ` ` ` `return` `Integer.MAX_VALUE; ` `// if first element is 0, ` ` ` `// end cannot be reached ` ` ` ` ` `jumps[` `0` `] = ` `0` `; ` ` ` ` ` `// Find the minimum number of jumps to reach arr[i] ` ` ` `// from arr[0], and assign this value to jumps[i] ` ` ` `for` `(i = ` `1` `; i < n; i++) { ` ` ` `jumps[i] = Integer.MAX_VALUE; ` ` ` `for` `(j = ` `0` `; j < i; j++) { ` ` ` `if` `(i <= j + arr[j] && jumps[j] != Integer.MAX_VALUE) { ` ` ` `jumps[i] = Math.min(jumps[i], jumps[j] + ` `1` `); ` ` ` `break` `; ` ` ` `} ` ` ` `} ` ` ` `} ` ` ` `return` `jumps[n - ` `1` `]; ` ` ` `} ` ` ` ` ` `// driver program to test above function ` ` ` `public` `static` `void` `main(String[] args) ` ` ` `{ ` ` ` `int` `arr[] = { ` `1` `, ` `3` `, ` `6` `, ` `1` `, ` `0` `, ` `9` `}; ` ` ` ` ` `System.out.println(` `"Minimum number of jumps to reach end is : "` `+ minJumps(arr, arr.length)); ` ` ` `} ` `} ` ` ` `// This code is contributed by Arnav Kr. Mandal. ` |

*chevron_right*

*filter_none*

**Output:**

Minimum number of jumps to reach end is : 3

Please refer complete article on Minimum number of jumps to reach end for more details!