From b0a7b83179c9f8eeebe33dd637c7e94627a80683 Mon Sep 17 00:00:00 2001 From: daiyongg-kim <134879427+daiyongg-kim@users.noreply.github.com> Date: Sun, 23 Nov 2025 19:50:17 -0800 Subject: [PATCH 1/6] adding palindrome --- combination-sum/daiyongg-kim.py | 0 decode-ways/daiyongg-kim.py | 0 maximum-subarray/daiyongg-kim.py | 0 number-of-1-bits/daiyongg-kim.py | 0 valid-palindrome/daiyongg-kim.py | 5 +++++ 5 files changed, 5 insertions(+) create mode 100644 combination-sum/daiyongg-kim.py create mode 100644 decode-ways/daiyongg-kim.py create mode 100644 maximum-subarray/daiyongg-kim.py create mode 100644 number-of-1-bits/daiyongg-kim.py create mode 100644 valid-palindrome/daiyongg-kim.py diff --git a/combination-sum/daiyongg-kim.py b/combination-sum/daiyongg-kim.py new file mode 100644 index 0000000000..e69de29bb2 diff --git a/decode-ways/daiyongg-kim.py b/decode-ways/daiyongg-kim.py new file mode 100644 index 0000000000..e69de29bb2 diff --git a/maximum-subarray/daiyongg-kim.py b/maximum-subarray/daiyongg-kim.py new file mode 100644 index 0000000000..e69de29bb2 diff --git a/number-of-1-bits/daiyongg-kim.py b/number-of-1-bits/daiyongg-kim.py new file mode 100644 index 0000000000..e69de29bb2 diff --git a/valid-palindrome/daiyongg-kim.py b/valid-palindrome/daiyongg-kim.py new file mode 100644 index 0000000000..4d648f54a1 --- /dev/null +++ b/valid-palindrome/daiyongg-kim.py @@ -0,0 +1,5 @@ +class Solution: + def isPalindrome(self, s: str) -> bool: + s = re.sub(r'[^0-9A-Za-z]', '',s).lower() + return s == s[::-1] + \ No newline at end of file From e7ad31fd27b703d746c9ff5fa46454453dae9352 Mon Sep 17 00:00:00 2001 From: daiyongg-kim <134879427+daiyongg-kim@users.noreply.github.com> Date: Sun, 23 Nov 2025 20:37:53 -0800 Subject: [PATCH 2/6] adding number of 1 bits --- number-of-1-bits/daiyongg-kim.py | 10 ++++++++++ 1 file changed, 10 insertions(+) diff --git a/number-of-1-bits/daiyongg-kim.py b/number-of-1-bits/daiyongg-kim.py index e69de29bb2..e16599eee6 100644 --- a/number-of-1-bits/daiyongg-kim.py +++ b/number-of-1-bits/daiyongg-kim.py @@ -0,0 +1,10 @@ +class Solution: + def hammingWeight(self, n: int) -> int: + cnt = 0 + + while n != 0: + if n & 1: + cnt += 1 + n = n >> 1 + + return cnt From c44ec3850d1d4b7ff10d92e6b50eb5058aa2ed0c Mon Sep 17 00:00:00 2001 From: daiyongg-kim <134879427+daiyongg-kim@users.noreply.github.com> Date: Sun, 23 Nov 2025 22:58:12 -0800 Subject: [PATCH 3/6] update line --- valid-palindrome/daiyongg-kim.py | 3 +-- 1 file changed, 1 insertion(+), 2 deletions(-) diff --git a/valid-palindrome/daiyongg-kim.py b/valid-palindrome/daiyongg-kim.py index 4d648f54a1..c7d5d02902 100644 --- a/valid-palindrome/daiyongg-kim.py +++ b/valid-palindrome/daiyongg-kim.py @@ -1,5 +1,4 @@ class Solution: def isPalindrome(self, s: str) -> bool: s = re.sub(r'[^0-9A-Za-z]', '',s).lower() - return s == s[::-1] - \ No newline at end of file + return s == s[::-1] \ No newline at end of file From da6507b87300acaeb3bf76c4e288d7e1394603ea Mon Sep 17 00:00:00 2001 From: daiyongg-kim <134879427+daiyongg-kim@users.noreply.github.com> Date: Sun, 23 Nov 2025 22:59:16 -0800 Subject: [PATCH 4/6] update line --- valid-palindrome/daiyongg-kim.py | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/valid-palindrome/daiyongg-kim.py b/valid-palindrome/daiyongg-kim.py index c7d5d02902..b1621bb3b3 100644 --- a/valid-palindrome/daiyongg-kim.py +++ b/valid-palindrome/daiyongg-kim.py @@ -1,4 +1,4 @@ class Solution: def isPalindrome(self, s: str) -> bool: s = re.sub(r'[^0-9A-Za-z]', '',s).lower() - return s == s[::-1] \ No newline at end of file + return s == s[::-1] From 6b7bef525d279e48d69f48ecc73b7c76bc6ab0f7 Mon Sep 17 00:00:00 2001 From: daiyongg-kim <134879427+daiyongg-kim@users.noreply.github.com> Date: Mon, 24 Nov 2025 16:54:22 -0800 Subject: [PATCH 5/6] adding combination sum --- combination-sum/daiyongg-kim.py | 26 ++++++++++++++++++++++++++ 1 file changed, 26 insertions(+) diff --git a/combination-sum/daiyongg-kim.py b/combination-sum/daiyongg-kim.py index e69de29bb2..a5b304628f 100644 --- a/combination-sum/daiyongg-kim.py +++ b/combination-sum/daiyongg-kim.py @@ -0,0 +1,26 @@ +class Solution: + def combinationSum(self, candidates: List[int], target: int) -> List[List[int]]: + candidates.sort() + result = [] + + def backtracking(start_index, current_combination, current_sum): + if current_sum == target: + result.append(list(current_combination)) + return + + if current_sum > target: + return + + for i in range(start_index, len(candidates)): + candidate = candidates[i] + + if current_sum + candidate > target: + break + + current_combination.append(candidate) + backtracking(i, current_combination, current_sum + candidate) + + current_combination.pop() + + backtracking(0, [], 0) + return result From 7eb92a69193b5b5e4cbd1e7afa7fcbf48a6386a9 Mon Sep 17 00:00:00 2001 From: daiyongg-kim <134879427+daiyongg-kim@users.noreply.github.com> Date: Wed, 26 Nov 2025 09:47:18 -0800 Subject: [PATCH 6/6] adding maximum-subarray --- maximum-subarray/daiyongg-kim.py | 10 ++++++++++ 1 file changed, 10 insertions(+) diff --git a/maximum-subarray/daiyongg-kim.py b/maximum-subarray/daiyongg-kim.py index e69de29bb2..c1f4ecb7f2 100644 --- a/maximum-subarray/daiyongg-kim.py +++ b/maximum-subarray/daiyongg-kim.py @@ -0,0 +1,10 @@ +class Solution: + def maxSubArray(self, nums: List[int]) -> int: + current_sum = nums[0] + max_sum = nums[0] + + for i in range(1, len(nums)): + current_sum = max(nums[i], current_sum + nums[i]) + max_sum = max(current_sum, max_sum) + + return max_sum