From 566f0f9353540760d63d7d293610182466ace868 Mon Sep 17 00:00:00 2001
From: jinah92 <jinah0818@gmail.com>
Date: Fri, 27 Dec 2024 11:22:33 +0900
Subject: [PATCH] =?UTF-8?q?feat:=20week3=20easy=20=EB=AC=B8=EC=A0=9C=20?=
 =?UTF-8?q?=ED=92=80=EC=9D=B4?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 reverse-bits/jinah92.py | 14 ++++++++++++++
 two-sum/jinah92.py      | 12 ++++++++++++
 2 files changed, 26 insertions(+)
 create mode 100644 reverse-bits/jinah92.py
 create mode 100644 two-sum/jinah92.py

diff --git a/reverse-bits/jinah92.py b/reverse-bits/jinah92.py
new file mode 100644
index 000000000..4d2d8cf5e
--- /dev/null
+++ b/reverse-bits/jinah92.py
@@ -0,0 +1,14 @@
+# O(1) time, O(1) space
+class Solution:
+    def reverseBits(self, n: int) -> int:
+        stack = []
+        while len(stack) < 32:
+            stack.append(n % 2)
+            n //=2
+        
+        result, scale = 0, 1
+        while stack:
+            result += stack.pop() * scale
+            scale *= 2
+        
+        return result
diff --git a/two-sum/jinah92.py b/two-sum/jinah92.py
new file mode 100644
index 000000000..e8b204155
--- /dev/null
+++ b/two-sum/jinah92.py
@@ -0,0 +1,12 @@
+# O(n) time, O(n) space
+
+class Solution:
+    def twoSum(self, nums: List[int], target: int) -> List[int]:
+        num_set = {}
+        
+        for idx, num in enumerate(nums):
+            other_num = target - num
+            if other_num in num_set:
+                return [idx, num_set[other_num]]
+            else:
+                num_set[num] = idx