feat: 문제풀이 추가

Author: JEONGHWANMIN

longest-consecutive-sequence/hwanmini.js

@@ -0,0 +1,32 @@
+// 시간 복잡도 O(n log n)
+// 공간 복잡도 O(n)
+
+/**
+ * @param {number[]} nums
+ * @return {number}
+ */
+var longestConsecutive = function(nums) {
+    if (nums.length === 0) return []
+
+    let maxSequenceLength = -Infinity
+
+
+    const setNums = [...new Set(nums)].toSorted((a,b) => a - b)
+
+    let count = 0;
+    for (let i = 0 ; i < setNums.length; i++) {
+        if (setNums[i]+1 === setNums[i+1]) {
+            count += 1
+        } else {
+            count += 1
+            maxSequenceLength = Math.max(maxSequenceLength, count)
+            count = 0;
+        }
+    }
+
+    return maxSequenceLength
+};
+
+
+console.log(longestConsecutive([100,4,200,1,3,2]))
+console.log(longestConsecutive([0,3,7,2,5,8,4,6,0,1]))

missing-number/hwanmini.js

@@ -0,0 +1,19 @@
+// 시간복잡도 O(n log n)
+// 공간복잡도 O(1)
+
+/**
+ * @param {number[]} nums
+ * @return {number}
+ */
+var missingNumber = function(nums) {
+    nums.sort((a,b) => a - b);
+
+    for (let i = 0 ; i <= nums.length; i++) {
+        if (i !== nums[i]) return i
+    }
+
+};
+
+console.log(missingNumber([3, 0, 1]))
+console.log(missingNumber([0, 1]))
+console.log(missingNumber([9,6,4,2,3,5,7,0,1]))