[sun] W1 Solutions

contains-duplicate/sun912.py

@@ -0,0 +1,8 @@
+"""
+    Time complexity: O(n)
+"""
+
+class Solution:
+    def containsDuplicate(self, nums: List[int]) -> bool:
+        nums_set = set(nums)
+        return len(nums_set) != len(nums)

number-of-1-bits/sun912.py

@@ -0,0 +1,13 @@
+"""
+ TC: O(log n)
+ SC: O(1)
+"""
+
+class Solution:
+    def hammingWeight(self, n: int) -> int:
+        result = 0
+        while n > 0:
+            result += n % 2
+            n = n//2
+
+        return result