week 3: Number of 1 bits

Author: prograsshopper

number-of-1-bits/prograsshopper.py

@@ -0,0 +1,10 @@
+class Solution:
+    def hammingWeight(self, n: int) -> int:
+        # Time complexity: O(log n)
+        output = 1
+        while n > 1:
+            remain = n % 2
+            n = n // 2
+            if remain == 1:
+                output += 1
+        return output

valid-palindrome/prograsshopper.py

@@ -3,9 +3,11 @@ def isPalindrome(self, s: str) -> bool:
         formatted_string = "".join(elem.lower() for elem in s if elem.isalnum())
 
         # sol 1
+        # Time complexity: O(n)
         return formatted_string == formatted_string[::-1]
 
         # sol 2
+        # Time complexity: O(n)
         left = 0
         right = len(formatted_string) - 1
         while left < right: