Minimum Jumps Required

#1

https://ide.codingblocks.com/s/241969 I am getting the wrong answer here can you guide me

#2

@abhishekjohri98,

  • Start from the second element, move from right to left and construct the jumps[] array where jumps[i] represents minimum number of jumps needed to reach arr[m-1] from arr[i]
  • If arr[i] is 0 then arr[n-1] can’t be reached from here
  • If we can directly reach to the end point from here then jumps[i] is
  • Otherwise, to find out the minimum number of jumps needed to reach arr[n-1], check all the points reachable from here and jumps[] value for those points

https://ide.codingblocks.com/s/242196 corrected code