Merge pull request #2110 from mandel-17/main

[madel-17] WEEK 03 solutions

Author: mandel-17

combination-sum/mandel-17.py

@@ -0,0 +1,19 @@
+from typing import List
+
+class Solution:
+    def combinationSum(self, candidates: List[int], target: int) -> List[List[int]]:
+        result = []
+        
+        def dfs(csum, index, path):
+            if csum < 0:
+                return
+            if csum == 0:
+                result.append(path)
+                return
+        
+            for i in range(index, len(candidates)):
+                dfs(csum - candidates[i], i, path + [candidates[i]])
+            
+        dfs(target, 0, [])
+        return result
+        

number-of-1-bits/mandel-17.py

@@ -0,0 +1,10 @@
+import collections
+
+class Solution:
+    def hammingWeight(self, n: int) -> int:
+        two_digit = []
+        while n >= 1:
+            two_digit.append(n % 2)
+            n = n // 2
+        cnt_dict = collections.Counter(two_digit)
+        return cnt_dict[1]

valid-palindrome/mandel-17.py

@@ -0,0 +1,4 @@
+class Solution:
+    def isPalindrome(self, s: str) -> bool:
+        ch = [c.lower() for c in s if c.isalnum()]
+        return ch == ch[::-1]