test commit

Author: tarolling

.github/workflows/publish.yml

@@ -0,0 +1,19 @@
+name: Publish
+on:
+  push:
+    branches:
+      - main
+
+jobs:
+  publish:
+    runs-on: ubuntu-latest
+
+    permissions:
+      contents: read
+      id-token: write
+
+    steps:
+      - uses: actions/checkout@v4
+
+      - name: Publish package
+        run: npx jsr publish

.vscode/settings.json

@@ -0,0 +1,3 @@
+{
+  "deno.enable": true
+}

README.md

@@ -1 +1,3 @@
-# JavaScript
+# JavaScript
+
+Implementations of LeetCode problem solutions in JavaScript.

deno.json

@@ -0,0 +1,17 @@
+{
+  "name": "@leetcode/leetcodejs",
+  "version": "0.0.1",
+  "exports": "./src/mod.ts",
+  "tasks": {
+    "dev": "deno run --watch main.ts"
+  },
+  "imports": {
+    "@std/assert": "jsr:@std/assert@1"
+  },
+  "fmt": {
+    "include": [ "src/", "tests/" ]
+  },
+  "lint": {
+    "include": [ "src/", "tests/" ]
+  }
+}

deno.lock

@@ -0,0 +1,43 @@
+/**
+ * Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target.
+ * You may assume that each input would have exactly one solution, and you may not use the same element twice.
+ *
+ * You can return the answer in any order.
+ *
+ * Example 1:
+ *
+ * Input: nums = [2,7,11,15], target = 9
+ * Output: [0,1]
+ * Explanation: Because nums[0] + nums[1] == 9, we return [0, 1].
+ *
+ * Example 2:
+ *
+ * Input: nums = [3,2,4], target = 6
+ * Output: [1,2]
+ *
+ * Example 3:
+ *
+ * Input: nums = [3,3], target = 6
+ * Output: [0,1]
+ *
+ * Constraints:
+ * - 2 <= nums.length <= 10^4
+ * - -10^9 <= nums[i] <= 10^9
+ * - -10^9 <= target <= 10^9
+ * - Only one valid answer exists.
+
+ * @param nums
+ * @param target
+ * @returns
+ */
+export function twoSum(nums: number[], target: number): number[] {
+  const map: Map<number, number> = new Map();
+  for (let i = 0; i < nums.length; i++) {
+    const complement = target - nums[i];
+    if (map.has(complement)) {
+      return [map.get(complement), i];
+    }
+    map.set(nums[i], i);
+  }
+  return [];
+}

src/easy.ts

@@ -0,0 +1,5 @@
+import * as easy from "./easy.ts";
+import * as medium from "./medium.ts";
+import * as hard from "./hard.ts";
+
+export { easy, hard, medium };

src/hard.ts

@@ -0,0 +1,8 @@
+import { assertArrayIncludes } from "@std/assert";
+import * as easy from "../src/easy.ts";
+
+Deno.test(function twoSumTest() {
+  assertArrayIncludes(easy.twoSum([2, 7, 11, 15], 9), [0, 1]);
+  assertArrayIncludes(easy.twoSum([3, 2, 4], 6), [1, 2]);
+  assertArrayIncludes(easy.twoSum([3, 3], 6), [0, 1]);
+});