Merge pull request #1328 from Sung-Heon/main

[Sung-Heon] Week 03 solutions

Author: Sung-Heon

Diff for: combination-sum/Sung-Heon.py

@@ -0,0 +1,20 @@
+class Solution:
+    def combinationSum(self, candidates: list[int], target: int) -> list[list[int]]:
+        result = []
+
+        def backtrack(start: int, target: int, current: list[int]):
+            if target == 0:
+                result.append(current[:])
+                return
+
+            for i in range(start, len(candidates)):
+                if candidates[i] > target:
+                    continue
+
+                current.append(candidates[i])
+                backtrack(i, target - candidates[i], current)
+                current.pop()
+
+        candidates.sort()
+        backtrack(0, target, [])
+        return result

Diff for: decode-ways/Sung-Heon.py

@@ -0,0 +1,19 @@
+class Solution:
+    def numDecodings(self, s: str) -> int:
+        if not s or s[0] == '0':
+            return 0
+
+        n = len(s)
+        dp = [0] * (n + 1)
+        dp[0] = 1
+        dp[1] = 1
+
+        for i in range(2, n + 1):
+            if s[i - 1] != '0':
+                dp[i] += dp[i - 1]
+
+            two_digit = int(s[i - 2:i])
+            if 10 <= two_digit <= 26:
+                dp[i] += dp[i - 2]
+
+        return dp[n]

Diff for: maximum-subarray/Sung-Heon.py

@@ -0,0 +1,10 @@
+class Solution:
+    def maxSubArray(self, nums: list[int]) -> int:
+        max_sum = nums[0]
+        current_sum = nums[0]
+
+        for num in nums[1:]:
+            current_sum = max(num, current_sum + num)
+            max_sum = max(max_sum, current_sum)
+
+        return max_sum

Diff for: number-of-1-bits/Sung-Heon.py

@@ -0,0 +1,7 @@
+class Solution:
+    def hammingWeight(self, n: int) -> int:
+        count = 0
+        while n:
+            count += n & 1
+            n >>= 1
+        return count

Diff for: valid-palindrome/Sung-Heon.py

@@ -0,0 +1,24 @@
+class Solution:
+    def isPalindrome(self, s: str) -> bool:
+        filtered = ''.join(char.lower() for char in s if char.isalnum())
+        end = len(filtered) - 1
+        if end <= 0:
+            return True
+        start = 0
+        while True:
+            end_s = filtered[end]
+            start_s = filtered[start]
+            if end_s == start_s:
+                end -= 1
+                start += 1
+
+
+            else:
+                return False
+            if start >= end:
+                return True
+            if end <= 0:
+                return True
+            continue
+
+