[:solved] two problems

Author: ppxyn1

number-of-1-bits/ppxyn1.py

@@ -0,0 +1,10 @@
+# idea: - 
+
+from collections import Counter
+class Solution:
+    def hammingWeight(self, n: int) -> int:
+        bits = bin(n).split('0b')[-1]
+        return Counter(bits)['1']
+
+
+

valid-palindrome/ppxyn1.py

@@ -0,0 +1,11 @@
+# idea : regex
+import re 
+
+class Solution:
+    def isPalindrome(self, s: str) -> bool:
+        alphabet = re.sub(r'[^A-Za-z0-9]', '', s).lower()
+
+        return alphabet == alphabet[::-1]
+
+        
+