solution: 0045. Jump Game II

src/0045/index.test.ts

@@ -19,10 +19,16 @@ describe('0045. Jump Game II', () => {
       },
       output: 2,
     },
+    {
+      input: {
+        nums: [1, 1, 1, 1, 1],
+      },
+      output: 4,
+    },
   ];
 
   test.each(testCases)('Case %#', ({ input: { nums }, output }) => {
-    const relsult = jump(nums);
+    const result = jump(nums);
     expect(result).toStrictEqual(output);
   });
 });

src/0045/index.ts

@@ -1,3 +1,18 @@
-function jump(nums: number[]): number {}
+function jump(nums: number[]): number {
+  let result = 0;
+  let availableSteps = 0;
+  let currentIndex = 0;
+  for (let i = 0; i < nums.length - 1; i++) {
+    if (nums.length - 1 <= i + nums[i]) {
+      return result + 1;
+    }
+    availableSteps = Math.max(availableSteps, nums[i] + i);
+    if (i === currentIndex) {
+      result += 1;
+      currentIndex = availableSteps;
+    }
+  }
+  return result;
+}
 
 export { jump };