Add new line

Author: mandel-17

combination-sum/mandel-17.py

@@ -16,4 +16,4 @@ def dfs(csum, index, path):
 
         dfs(target, 0, [])
         return result
-    
+        

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

@@ -8,4 +8,4 @@ def hammingWeight(self, n: int) -> int:
             n = n // 2
         cnt_dict = collections.Counter(two_digit)
         return cnt_dict[1]
-    
+        

valid-palindrome/mandel-17.py

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