Merge pull request #1990 from hozzijeong/hozzijeong-patch-1

[hozzijeong] week01 solutions

Author: hozzijeong

contains-duplicate/hozzijeong.js

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

longest-consecutive-sequence/hozzijeong.js

@@ -0,0 +1,33 @@
+/**
+ * @param {number[]} nums
+ * @return {number}
+ */
+var longestConsecutive = function(nums) {
+    const numsSet = new Set(nums);
+
+
+    if(nums.length === 0) return 0
+
+    const sortedNums = [...numsSet].sort((a,b) => a-b);
+
+    const results = [];
+
+    let result = 1;
+
+    for(let i = 0; i < sortedNums.length-1; i++){
+        const current = sortedNums[i];
+        const next = sortedNums[i+1];
+
+        if((current + 1) === next){
+            result += 1;
+        }else{
+            results.push(result);
+            result = 1;
+        }
+    }
+
+    results.push(result);
+
+
+    return Math.max(...results)
+};

top-k-frequent-elements/hozzijeong.js

@@ -0,0 +1,25 @@
+/**
+ * @param {number[]} nums
+ * @param {number} k
+ * @return {number[]}
+ */
+var topKFrequent = function(nums, k) {
+    const numsMap = new Map();
+
+    for(const num of nums){
+        const currentNums = numsMap.get(num);
+
+        if(!currentNums){
+            numsMap.set(num, 1);
+            continue;
+        }
+
+        numsMap.set(num, currentNums + 1)
+    }
+
+    const sortedNums = [...numsMap].sort((a,b) => b[1] - a[1]);
+
+    const frequencyNums = sortedNums.map(([num])=> num);
+
+    return frequencyNums.slice(0,k);
+};

two-sum/hozzijeong.js

@@ -0,0 +1,17 @@
+/**
+ * @param {number[]} nums
+ * @param {number} target
+ * @return {number[]}
+ */
+var twoSum = function(nums, target) {
+    for(let i =0; i < nums.length - 1; i++){
+        const first = nums[i];
+        for(let j = i + 1; j < nums.length; j++){
+            const last = nums[j];
+
+            if((first + last) === target) return [i,j]
+        }
+    }
+
+    return []
+};