LeetCode: Jump Game II Solution

1/**
2 * @param {number[]} nums
3 * @return {number}
4 */
5var jump = function (nums) {
6  const recursion = (i, memo = {}) => {
7    if (memo[i] !== undefined) {
8      return memo[i]
9    }
10
11    if (i >= nums.length - 1) {
12      return 0
13    }
14
15    let minSteps = Infinity
16    for (let step = 1; step <= nums[i]; step++) {
17      minSteps = Math.min(minSteps, 1 + recursion(i + step, memo))
18    }
19
20    return (memo[i] = minSteps)
21  }
22
23  return recursion(0)
24}