you give 0indexed array integer num length n you initially position nums0each element numsi represent maximum length forward jump index in word numsi jump numsi j where0 j numsi andi j nReturn minimum number jump reach numsn 1 the test case generate reach numsn 1 Example 1input num 23114output 2explanation the minimum number jump reach index 2 jump 1 step index 0 1 3 step indexExample 2input num 23014output 2 Constraints1 numslength 1040 numsi 1000