problem: 0055. Jump Game

Author: flynnpark

src/0055/README.md

@@ -0,0 +1,26 @@
+# 0055. [Jump Game](https://leetcode.com/problems/jump-game/description/?envType=study-plan-v2&envId=top-interview-150)
+
+You are given an integer array `nums`. You are initially positioned at the array's **first index**, and each element in the array represents your maximum jump length at that position.
+
+Return `true` _if you can reach the last index, or_ `false` _otherwise_.
+
+### **Example 1:**
+
+<pre><code>
+<strong>Input:</strong> nums = [2,3,1,1,4]
+<strong>Output:</strong> true
+<strong>Explanation:</strong> 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 = [3,2,1,0,4]
+<strong>Output:</strong> false
+<strong>Explanation:</strong> You will always arrive at index 3 no matter what. Its maximum jump length is 0, which makes it impossible to reach the last index.
+</code></pre>
+
+### **Constraints:**
+
+- <code>1 <= nums.length <= 10<sup>4</sup></code>
+- <code>0 <= nums[i] <= 10<sup>5</sup></code>

src/0055/index.test.ts

@@ -0,0 +1,28 @@
+import { canJump } from '.';
+
+describe('0055. Jump Game', () => {
+  interface TestCase {
+    input: { nums: number[] };
+    output: boolean;
+  }
+
+  const testCases: TestCase[] = [
+    {
+      input: {
+        nums: [2, 3, 1, 1, 4],
+      },
+      output: true,
+    },
+    {
+      input: {
+        nums: [3, 2, 1, 0, 4],
+      },
+      output: false,
+    },
+  ];
+
+  test.each(testCases)('Case %#', ({ input: { prices }, output }) => {
+    const result = canJump(prices);
+    expect(result).toBe(output);
+  });
+});

src/0055/index.ts

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