problem: 0045. Jump Game II

Author: flynnpark

src/0045/README.md

@@ -0,0 +1,31 @@
+# 0045. [Jump Game II]()
+
+You are given a 0-indexed array of integers `nums` of length `n`. You are initially positioned at `nums[0]`.
+
+Each element `nums[i]` represents the maximum length of a forward jump from index `i`. In other words, if you are at `nums[i]`, you can jump to any `nums[i + j]` where:
+
+- `0 <= j <= nums[i]` and
+- `i + j < n`
+
+Return the minimum number of jumps to reach `nums[n - 1]`. The test cases are generated such that you can reach `nums[n - 1]`.
+
+### **Example 1:**
+
+<pre><code>
+<strong>Input:</strong> nums = [2,3,1,1,4]
+<strong>Output:</strong> 2
+<strong>Explanation:</strong> The minimum number of jumps to reach the last index is 2. Jump 1 step from index 0 to 1, then 3 steps to the last index.
+</code></pre>
+
+### **Example 2:**
+
+<pre><code>
+<strong>Input:</strong> nums = [2,3,0,1,4]
+<strong>Output:</strong> 2
+</code></pre>
+
+### **Constraints:**
+
+- <code>1 <= nums.length <= 10<sup>4</sup></code>
+- <code>0 <= nums[i] <= 1000</code>
+- It's guaranteed that you can reach `nums[n - 1]`.

src/0045/index.test.ts

@@ -0,0 +1,28 @@
+import { jump } from '.';
+
+describe('0045. Jump Game II', () => {
+  interface TestCase {
+    input: { nums: number[] };
+    output: number;
+  }
+
+  const testCases: TestCase[] = [
+    {
+      input: {
+        nums: [2, 3, 1, 1, 4],
+      },
+      output: 2,
+    },
+    {
+      input: {
+        nums: [2, 3, 0, 1, 4],
+      },
+      output: 2,
+    },
+  ];
+
+  test.each(testCases)('Case %#', ({ input: { nums }, output }) => {
+    const relsult = jump(nums);
+    expect(result).toStrictEqual(output);
+  });
+});

src/0045/index.ts

@@ -0,0 +1,3 @@
+function jump(nums: number[]): number {}
+
+export { jump };