From 90fec72701c1449a4e94533c46ae92285de5a609 Mon Sep 17 00:00:00 2001
From: jaeyeonjung <87858105+solbijae@users.noreply.github.com>
Date: Mon, 21 Jul 2025 10:20:32 +0900
Subject: [PATCH 1/5] contains-duplicate solution

---
 contains-duplicate/solbijae.ts | 11 +++++++++++
 1 file changed, 11 insertions(+)
 create mode 100644 contains-duplicate/solbijae.ts

diff --git a/contains-duplicate/solbijae.ts b/contains-duplicate/solbijae.ts
new file mode 100644
index 000000000..87f020a24
--- /dev/null
+++ b/contains-duplicate/solbijae.ts
@@ -0,0 +1,11 @@
+function containsDuplicate(nums: number[]): boolean {
+    const set = new Set(nums);
+    const setSize = set.size;
+    const numsLength = nums.length;
+
+    return setSize !== numsLength ? true : false;
+
+    // Big O
+    // 시간 복잡도: O(n) 한번씩 순회하면서 확인
+    // 공간 복잡도: O(n) Set을 사용해 배열 크기만큼 메모리가 더 사용됨
+};

From 89b7dd58ff85e9dabf620ad415aedf00f511f41f Mon Sep 17 00:00:00 2001
From: jaeyeonjung <87858105+solbijae@users.noreply.github.com>
Date: Tue, 22 Jul 2025 15:36:42 +0900
Subject: [PATCH 2/5] two-sum solution

---
 two-sum/solbijae.ts | 19 +++++++++++++++++++
 1 file changed, 19 insertions(+)
 create mode 100644 two-sum/solbijae.ts

diff --git a/two-sum/solbijae.ts b/two-sum/solbijae.ts
new file mode 100644
index 000000000..b6ff2e6b9
--- /dev/null
+++ b/two-sum/solbijae.ts
@@ -0,0 +1,19 @@
+function twoSum(nums: number[], target: number): number[] {
+    // 첫 코드: 시간 복잡도가 O(n^2)로 개선 필요
+    // for (let i=0; i<nums.length-1; i++) {
+    //     for (let j=1; j<nums.length; j++) {
+    //         if (nums[i] + nums[j] === target) return [i, j];
+    //     }
+    // }
+
+    // 시간 공간 모두 O(n)으로 만들기 위해 해시맵 사용
+    const map = new Map();
+    for (let i=0; i<nums.length; i++) {
+        const complement = target - nums[i];
+        if (map.get(complement) !== undefined) {
+            return [map.get(complement)!, i];
+        } else {
+            map.set(nums[i], i);
+        }
+    }
+};

From f804393fb17561cf015631f6fdaa295fec46b61d Mon Sep 17 00:00:00 2001
From: jaeyeonjung <87858105+solbijae@users.noreply.github.com>
Date: Wed, 23 Jul 2025 13:19:11 +0900
Subject: [PATCH 3/5] top-k-frequent-elements

---
 top-k-frequent-elements/solbijae.ts | 16 ++++++++++++++++
 1 file changed, 16 insertions(+)
 create mode 100644 top-k-frequent-elements/solbijae.ts

diff --git a/top-k-frequent-elements/solbijae.ts b/top-k-frequent-elements/solbijae.ts
new file mode 100644
index 000000000..19b461626
--- /dev/null
+++ b/top-k-frequent-elements/solbijae.ts
@@ -0,0 +1,16 @@
+function topKFrequent(nums: number[], k: number): number[] {
+    const map = new Map();
+
+    for (let i=0; i<nums.length; i++) {
+        const num = nums[i]
+        map.set(num, (map.get(num)|| 0) + 1 );
+    }
+
+    return [...map.entries()]
+        .sort((a, b) => b[1] - a[1])
+        .slice(0, k)
+        .map(([key]) => key);
+};
+
+// 시간 복잡도: O(n log n)
+// 공간 복잡도: O(n)

From 2b4df3952f2f73eee60c1112a58b6e0b1c437a70 Mon Sep 17 00:00:00 2001
From: jaeyeonjung <87858105+solbijae@users.noreply.github.com>
Date: Thu, 24 Jul 2025 11:08:50 +0900
Subject: [PATCH 4/5] longest-consecutive-sequence solution

---
 longest-consecutive-sequence/solbijae.ts | 44 ++++++++++++++++++++++++
 1 file changed, 44 insertions(+)
 create mode 100644 longest-consecutive-sequence/solbijae.ts

diff --git a/longest-consecutive-sequence/solbijae.ts b/longest-consecutive-sequence/solbijae.ts
new file mode 100644
index 000000000..3fc3655b2
--- /dev/null
+++ b/longest-consecutive-sequence/solbijae.ts
@@ -0,0 +1,44 @@
+function longestConsecutive(nums: number[]): number {
+    // 첫 시도: sort때문에 시간 복잡도가 O(n log n)라 O(n)에 풀어야 한다는 요구사항 만족하지 못함, 공간복잡도는 O(n)
+    // if (nums.length === 0) return 0;
+    // const sorted = [...new Set(nums)].sort((a, b) => a-b);
+    // let max = 1;
+    // let current = 1;
+
+    // for (let i=0; i<nums.length; i++) {
+    // console.log(sorted[i])
+    // if (sorted[i+1] - sorted[i] === 1) {
+    //     current += 1;
+    // } else {
+    //     current = 1;
+    // }
+
+    // max = Math.max(max, current);
+    // }
+
+    // return max;
+
+    // 두번째 시도: 시간, 공간복잡도 O(n)
+    if (nums.length === 0) return 0;
+    
+    const numSet = new Set(nums);
+    let current = 0;
+    let consecutive = 1;
+    let max = 1;
+
+    for (let num of numSet) {
+        if (!numSet.has(num - 1)) {
+            current = num;
+            consecutive = 1;
+
+            while (numSet.has(current + 1)) {
+                consecutive += 1;
+                current = current + 1;
+            }
+
+            max = Math.max(consecutive, max);
+        }
+    }
+
+    return max;
+};

From f6394452a65689618e436ea647740a856411dd37 Mon Sep 17 00:00:00 2001
From: jaeyeonjung <87858105+solbijae@users.noreply.github.com>
Date: Fri, 25 Jul 2025 14:25:33 +0900
Subject: [PATCH 5/5] house-robber solution

---
 house-robber/solbijae.ts | 30 ++++++++++++++++++++++++++++++
 1 file changed, 30 insertions(+)
 create mode 100644 house-robber/solbijae.ts

diff --git a/house-robber/solbijae.ts b/house-robber/solbijae.ts
new file mode 100644
index 000000000..42880c7d5
--- /dev/null
+++ b/house-robber/solbijae.ts
@@ -0,0 +1,30 @@
+function rob(nums: number[]): number {
+    // 첫시도: 아예 떨어져있는 경우를 고려하지 않음 (통과 안됨)
+    // let evenSum = 0;
+    // let oddSum = 0;
+    
+    // for (let i=0; i<nums.length; i++) {
+    //     if (i % 2 === 0) {
+    //         evenSum += nums[i];
+    //     } else {
+    //         oddSum += nums[i];
+    //     }
+    // }
+
+    // return Math.max(evenSum, oddSum);
+
+    // 시간복잡도 O(n), 공간복잡도 O(1)
+    if (nums.length === 0) return 0;
+    if (nums.length === 1) return nums[0];
+
+    let prev = nums[0];
+    let max = Math.max(nums[0], nums[1]);
+
+    for (let i = 2; i < nums.length; i++) {
+        const current = Math.max(max, prev + nums[i]);
+        prev = max;
+        max = current;
+    }
+
+    return max;
+};