From 598ae277e41513a021ad3663a0d85dec618c93fb Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?=EA=B9=80=EC=A4=80=ED=98=B8?=
 <101695482+chordpli@users.noreply.github.com>
Date: Sat, 26 Jul 2025 11:39:25 +0900
Subject: [PATCH] feat: 1week
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

feat: 1주차 1,2 문제
---
 contains-duplicate/chordpli.py | 12 ++++++++++++
 two-sum/chordpli.py            | 11 +++++++++++
 2 files changed, 23 insertions(+)
 create mode 100644 contains-duplicate/chordpli.py
 create mode 100644 two-sum/chordpli.py

diff --git a/contains-duplicate/chordpli.py b/contains-duplicate/chordpli.py
new file mode 100644
index 000000000..b61243832
--- /dev/null
+++ b/contains-duplicate/chordpli.py
@@ -0,0 +1,12 @@
+from typing import List
+
+class Solution:
+    def containsDuplicate(self, nums: List[int]) -> bool:
+        dic = {}
+
+        for num in nums:
+            if dic.get(num):
+                return True
+            dic[num] = 1
+
+        return False
diff --git a/two-sum/chordpli.py b/two-sum/chordpli.py
new file mode 100644
index 000000000..2e269a040
--- /dev/null
+++ b/two-sum/chordpli.py
@@ -0,0 +1,11 @@
+from typing import List
+
+class Solution:
+    def twoSum(self, nums: List[int], target: int) -> List[int]:
+        map = {}
+        for i, num in enumerate(nums):
+            complement = target - num
+            if complement in map:
+                return [map[complement], i]
+
+            map[num] = i