From 77751633dc8d67ec2505d2fd111a603fa0b55469 Mon Sep 17 00:00:00 2001
From: mrlee7 <jplee227@gmail.com>
Date: Mon, 16 Mar 2026 19:12:13 +0900
Subject: [PATCH 1/5] valid palindrome solution

---
 valid-palindrome/mrlee7.py | 7 +++++++
 1 file changed, 7 insertions(+)
 create mode 100644 valid-palindrome/mrlee7.py

diff --git a/valid-palindrome/mrlee7.py b/valid-palindrome/mrlee7.py
new file mode 100644
index 000000000..e4983e01d
--- /dev/null
+++ b/valid-palindrome/mrlee7.py
@@ -0,0 +1,7 @@
+import re
+
+
+class Solution:
+    def isPalindrome(self, s: str) -> bool:
+        result = re.sub(r'[^a-zA-Z0-9]', '', s).lower()
+        return result == result[::-1]

From c36dd0c024e0030aab4dc345fe46387572b6f4c7 Mon Sep 17 00:00:00 2001
From: mrlee7 <jplee227@gmail.com>
Date: Tue, 17 Mar 2026 21:20:38 +0900
Subject: [PATCH 2/5] number of 1 bits solution

---
 number-of-1-bits/mrlee7.py | 9 +++++++++
 1 file changed, 9 insertions(+)
 create mode 100644 number-of-1-bits/mrlee7.py

diff --git a/number-of-1-bits/mrlee7.py b/number-of-1-bits/mrlee7.py
new file mode 100644
index 000000000..dae830146
--- /dev/null
+++ b/number-of-1-bits/mrlee7.py
@@ -0,0 +1,9 @@
+class Solution:
+    def hammingWeight(self, n: int) -> int:
+        result = 0
+
+        while n > 0:
+            result += n % 2
+            n //= 2
+        return result
+

From 203d69c39bea03ba1aa427bfeb6a3898773d8d91 Mon Sep 17 00:00:00 2001
From: mrlee7 <jplee227@gmail.com>
Date: Tue, 17 Mar 2026 21:21:14 +0900
Subject: [PATCH 3/5] formatting code

---
 number-of-1-bits/mrlee7.py | 1 -
 1 file changed, 1 deletion(-)

diff --git a/number-of-1-bits/mrlee7.py b/number-of-1-bits/mrlee7.py
index dae830146..6b1b7f37d 100644
--- a/number-of-1-bits/mrlee7.py
+++ b/number-of-1-bits/mrlee7.py
@@ -6,4 +6,3 @@ def hammingWeight(self, n: int) -> int:
             result += n % 2
             n //= 2
         return result
-

From ab9e71b4d7273315ce4fef87e3d8b5f3cc87b785 Mon Sep 17 00:00:00 2001
From: mrlee7 <jplee227@gmail.com>
Date: Wed, 18 Mar 2026 17:16:16 +0900
Subject: [PATCH 4/5] combination sum solution

---
 combination-sum/mrlee7.py | 17 +++++++++++++++++
 1 file changed, 17 insertions(+)
 create mode 100644 combination-sum/mrlee7.py

diff --git a/combination-sum/mrlee7.py b/combination-sum/mrlee7.py
new file mode 100644
index 000000000..21ccedb87
--- /dev/null
+++ b/combination-sum/mrlee7.py
@@ -0,0 +1,17 @@
+class Solution:
+    def combinationSum(self, candidates: List[int], target: int) -> List[List[int]]:
+        result, nums = list(), list()
+
+        def dfs(start_position, total_sum):
+            if total_sum > target:
+                return
+            if total_sum == target:
+                result.append(nums[:])
+            for idx in range(start_position, len(candidates)):
+                num = candidates[idx]
+                nums.append(num)
+                dfs(idx, total_sum + num)
+                nums.pop()
+
+        dfs(0,0)
+        return result
\ No newline at end of file

From a13f6c232f3c118bad8593a7aebe9b35ed7f95fa Mon Sep 17 00:00:00 2001
From: mrlee7 <jplee227@gmail.com>
Date: Wed, 18 Mar 2026 17:16:35 +0900
Subject: [PATCH 5/5] combination sum solution

---
 combination-sum/mrlee7.py | 7 +++++--
 1 file changed, 5 insertions(+), 2 deletions(-)

diff --git a/combination-sum/mrlee7.py b/combination-sum/mrlee7.py
index 21ccedb87..6f1c3da82 100644
--- a/combination-sum/mrlee7.py
+++ b/combination-sum/mrlee7.py
@@ -1,3 +1,6 @@
+from typing import List
+
+
 class Solution:
     def combinationSum(self, candidates: List[int], target: int) -> List[List[int]]:
         result, nums = list(), list()
@@ -13,5 +16,5 @@ def dfs(start_position, total_sum):
                 dfs(idx, total_sum + num)
                 nums.pop()
 
-        dfs(0,0)
-        return result
\ No newline at end of file
+        dfs(0, 0)
+        return result