From 2c6b564f3513a7a77a3db1193c619a9bdf2dd3fb Mon Sep 17 00:00:00 2001
From: 8804 <8804who@naver.com>
Date: Fri, 14 Nov 2025 22:15:13 +0900
Subject: [PATCH 1/3] Week 1

---
 contains-duplicate/8804who.py           |  4 ++++
 house-robber/8804who.py                 | 14 ++++++++++++++
 longest-consecutive-sequence/8804who.py | 19 +++++++++++++++++++
 top-k-frequent-elements/8804who.py      | 11 +++++++++++
 two-sum/8804who.py                      |  8 ++++++++
 5 files changed, 56 insertions(+)
 create mode 100644 contains-duplicate/8804who.py
 create mode 100644 house-robber/8804who.py
 create mode 100644 longest-consecutive-sequence/8804who.py
 create mode 100644 top-k-frequent-elements/8804who.py
 create mode 100644 two-sum/8804who.py

diff --git a/contains-duplicate/8804who.py b/contains-duplicate/8804who.py
new file mode 100644
index 0000000000..49554005e6
--- /dev/null
+++ b/contains-duplicate/8804who.py
@@ -0,0 +1,4 @@
+class Solution:
+    def containsDuplicate(self, nums: List[int]) -> bool:
+        return len(set(nums)) != len(nums)
+    
diff --git a/house-robber/8804who.py b/house-robber/8804who.py
new file mode 100644
index 0000000000..6415bebd4f
--- /dev/null
+++ b/house-robber/8804who.py
@@ -0,0 +1,14 @@
+class Solution:
+    def rob(self, nums: List[int]) -> int:
+        if len(nums) == 1:
+            return nums[0]
+        elif len(nums) == 2:
+            return max(nums)
+        else:
+            nums = [0] + nums
+            dp = [0 for _ in range(len(nums))]
+            dp[1] = nums[1]
+            for i in range(1, len(nums)):
+                dp[i] = max(dp[i-2]+nums[i], dp[i-1])
+            return dp[-1]
+    
diff --git a/longest-consecutive-sequence/8804who.py b/longest-consecutive-sequence/8804who.py
new file mode 100644
index 0000000000..c6c92fb6b6
--- /dev/null
+++ b/longest-consecutive-sequence/8804who.py
@@ -0,0 +1,19 @@
+class Solution:
+    def longestConsecutive(self, nums: List[int]) -> int:
+        num_set = set(nums)
+        answer = 0
+        while num_set:
+            num = num_set.pop()
+            l, r = 1, 1
+            
+            while num - l in num_set:
+                num_set.remove(num-l)
+                l += 1
+            
+            while num + r in num_set:
+                num_set.remove(num+r)
+                r += 1
+            
+            answer = max(answer, l+r-1)
+        return answer
+        
\ No newline at end of file
diff --git a/top-k-frequent-elements/8804who.py b/top-k-frequent-elements/8804who.py
new file mode 100644
index 0000000000..29d6d2b9f1
--- /dev/null
+++ b/top-k-frequent-elements/8804who.py
@@ -0,0 +1,11 @@
+class Solution:
+    def topKFrequent(self, nums: List[int], k: int) -> List[int]:
+        num_list = {}
+        for num in nums:
+            if num not in num_list:
+                num_list[num] = 1
+            else:
+                num_list[num] += 1
+        
+        return [n[1] for n in sorted([[num_list[key], key] for key in num_list.keys()], reverse=True)[:k]]
+    
\ No newline at end of file
diff --git a/two-sum/8804who.py b/two-sum/8804who.py
new file mode 100644
index 0000000000..0db1aad63d
--- /dev/null
+++ b/two-sum/8804who.py
@@ -0,0 +1,8 @@
+class Solution:
+    def twoSum(self, nums: List[int], target: int) -> List[int]:
+        num_list = {}
+        for i in range(len(nums)):
+            if target-nums[i] in num_list:
+                return [num_list[target-nums[i]], i]
+            num_list[nums[i]] = i
+    

From ad2a43020e6ebfa4516629eb9f49addd727b54ee Mon Sep 17 00:00:00 2001
From: 8804 <8804who@naver.com>
Date: Sat, 15 Nov 2025 17:37:51 +0900
Subject: [PATCH 2/3] Week 1

---
 longest-consecutive-sequence/8804who.py | 1 +
 top-k-frequent-elements/8804who.py      | 1 +
 2 files changed, 2 insertions(+)

diff --git a/longest-consecutive-sequence/8804who.py b/longest-consecutive-sequence/8804who.py
index c6c92fb6b6..f7b81a8f9c 100644
--- a/longest-consecutive-sequence/8804who.py
+++ b/longest-consecutive-sequence/8804who.py
@@ -16,4 +16,5 @@ def longestConsecutive(self, nums: List[int]) -> int:
             
             answer = max(answer, l+r-1)
         return answer
+        
         
\ No newline at end of file
diff --git a/top-k-frequent-elements/8804who.py b/top-k-frequent-elements/8804who.py
index 29d6d2b9f1..0953139294 100644
--- a/top-k-frequent-elements/8804who.py
+++ b/top-k-frequent-elements/8804who.py
@@ -8,4 +8,5 @@ def topKFrequent(self, nums: List[int], k: int) -> List[int]:
                 num_list[num] += 1
         
         return [n[1] for n in sorted([[num_list[key], key] for key in num_list.keys()], reverse=True)[:k]]
+    
     
\ No newline at end of file

From 5b9595d97f78b147cb0249717f5645ad7376c1d1 Mon Sep 17 00:00:00 2001
From: 8804 <8804who@naver.com>
Date: Sat, 15 Nov 2025 17:40:16 +0900
Subject: [PATCH 3/3] Week 1

---
 longest-consecutive-sequence/8804who.py | 3 +--
 top-k-frequent-elements/8804who.py      | 1 -
 2 files changed, 1 insertion(+), 3 deletions(-)

diff --git a/longest-consecutive-sequence/8804who.py b/longest-consecutive-sequence/8804who.py
index f7b81a8f9c..fc5b59f62b 100644
--- a/longest-consecutive-sequence/8804who.py
+++ b/longest-consecutive-sequence/8804who.py
@@ -16,5 +16,4 @@ def longestConsecutive(self, nums: List[int]) -> int:
             
             answer = max(answer, l+r-1)
         return answer
-        
-        
\ No newline at end of file
+    
diff --git a/top-k-frequent-elements/8804who.py b/top-k-frequent-elements/8804who.py
index 0953139294..54aa8353c2 100644
--- a/top-k-frequent-elements/8804who.py
+++ b/top-k-frequent-elements/8804who.py
@@ -9,4 +9,3 @@ def topKFrequent(self, nums: List[int], k: int) -> List[int]:
         
         return [n[1] for n in sorted([[num_list[key], key] for key in num_list.keys()], reverse=True)[:k]]
     
-    
\ No newline at end of file