From 526a300417d855c33a6ccafe7fcc90270be75481 Mon Sep 17 00:00:00 2001
From: Nam Yooseong <nys8765@naver.com>
Date: Sun, 15 Nov 2026 15:20:42 +0900
Subject: [PATCH 1/3] contains duplicate solution

---
 contains-duplicate/meteorqz6.js | 12 ++++++++++++
 1 file changed, 12 insertions(+)
 create mode 100644 contains-duplicate/meteorqz6.js

diff --git a/contains-duplicate/meteorqz6.js b/contains-duplicate/meteorqz6.js
new file mode 100644
index 0000000000..945dc7a202
--- /dev/null
+++ b/contains-duplicate/meteorqz6.js
@@ -0,0 +1,12 @@
+// 시간 복잡도: O(n)
+// 공간 복잡도: O(n)
+
+/**
+ * @param {number[]} nums
+ * @return {boolean}
+ */
+var containsDuplicate = function (nums) {
+  const set = new Set(nums);
+  if (set.size < nums.length) return true;
+  else return false;
+};

From b17ef8ee46898d3d3bf48336ef247140bf9c221f Mon Sep 17 00:00:00 2001
From: Nam Yooseong <nys8765@naver.com>
Date: Sun, 15 Nov 2026 15:20:42 +0900
Subject: [PATCH 2/3] two sum solution

---
 two-sum/meteorqz6.js | 17 +++++++++++++++++
 1 file changed, 17 insertions(+)
 create mode 100644 two-sum/meteorqz6.js

diff --git a/two-sum/meteorqz6.js b/two-sum/meteorqz6.js
new file mode 100644
index 0000000000..f185d5d4c9
--- /dev/null
+++ b/two-sum/meteorqz6.js
@@ -0,0 +1,17 @@
+// 시간 복잡도: O(n^2)
+// 공간 복잡도: O(1)
+
+/**
+ * @param {number[]} nums
+ * @param {number} target
+ * @return {number[]}
+ */
+var twoSum = function (nums, target) {
+  for (let i = 0; i < nums.length; i++) {
+    for (let j = i + 1; j < nums.length; j++) {
+      if (nums[i] + nums[j] === target) {
+        return [i, j];
+      }
+    }
+  }
+};

From 979d3dad07bf4aa56781ab66fa7d7b5199603e25 Mon Sep 17 00:00:00 2001
From: Nam Yooseong <nys8765@naver.com>
Date: Sun, 15 Nov 2026 15:20:42 +0900
Subject: [PATCH 3/3] longest consecutive sequence solution

---
 longest-consecutive-sequence/meteorqz6.js | 25 +++++++++++++++++++++++
 1 file changed, 25 insertions(+)
 create mode 100644 longest-consecutive-sequence/meteorqz6.js

diff --git a/longest-consecutive-sequence/meteorqz6.js b/longest-consecutive-sequence/meteorqz6.js
new file mode 100644
index 0000000000..9165d8c39f
--- /dev/null
+++ b/longest-consecutive-sequence/meteorqz6.js
@@ -0,0 +1,25 @@
+// 시간 복잡도: O(n log n)
+// 공간 복잡도: O(n)
+
+/**
+ * @param {number[]} nums
+ * @return {number}
+ */
+var longestConsecutive = function (nums) {
+  let cnt = 0;
+  const set = new Set(nums);
+  const sortArray = Array.from(set).sort((a, b) => a - b);
+  const cntArray = [];
+
+  for (let i = 0; i < sortArray.length; i++) {
+    if (sortArray[i] + 1 !== sortArray[i + 1]) {
+      cntArray.push(cnt + 1);
+      cnt = 0;
+    } else {
+      cnt += 1;
+    }
+  }
+
+  if (nums.length === 0) return 0;
+  else return Math.max(...cntArray);
+};