style: lint

Author: chordpli

combination-sum/chordpli.py

@@ -26,4 +26,4 @@ def __backtrack__(self, candidates: List[int], current_idx: int, target: int, re
         current_arr.append(candidates[current_idx])
         self.__backtrack__(candidates, current_idx, target, result, current_arr)
         current_arr.pop()
-        self.__backtrack__(candidates, current_idx + 1, target, result, current_arr)
+        self.__backtrack__(candidates, current_idx + 1, target, result, current_arr)

number-of-1-bits/chordpli.py

@@ -1,3 +1,3 @@
 class Solution:
     def hammingWeight(self, n: int) -> int:
-        return bin(n).count('1')
+        return bin(n).count('1')

valid-palindrome/chordpli.py

@@ -10,4 +10,4 @@ def isPalindrome(self, s: str) -> bool:
         if lower_eng_str == reverse_str:
             return True
 
-        return False
+        return False