Merge pull request #2393 from j2h30728/main

[j2h300728] WEEK 01 solutions

Author: SamTheKorean

contains-duplicate/j2h30728.js

@@ -0,0 +1,8 @@
+/**
+ * @param {number[]} nums
+ * @return {boolean}
+ */
+var containsDuplicate = function (nums) {
+  const set = new Set(nums);
+  return set.size !== nums.length;
+};

maximum-subarray/j2h30728.js

@@ -0,0 +1,14 @@
+/**
+ * @param {number[]} nums
+ * @return {number}
+ */
+var maxSubArray = function (nums) {
+  let maxSum = nums[0];
+  let max = nums[0];
+
+  for (let i = 1; i < nums.length; i++) {
+    max = Math.max(nums[i], max + nums[i]);
+    maxSum = Math.max(max, maxSum);
+  }
+  return maxSum;
+};

two-sum/j2h30728.js

@@ -0,0 +1,18 @@
+/**
+ * @param {number[]} nums
+ * @param {number} target
+ * @return {number[]}
+ */
+var twoSum = function (nums, target) {
+  const map = new Map();
+
+  for (let i = 0; i < nums.length; i++) {
+    const num = target - nums[i];
+    if (map.has(num)) {
+      return [map.get(num), i];
+    }
+    map.set(nums[i], i);
+  }
+
+  return [];
+};