Final Revisions

Author: HYUNAHKO

combination-sum/HYUNAHKO.py

@@ -22,4 +22,3 @@ def backtrack(start_idx, current_combination, current_sum):
 
         backtrack(0, [], 0)
         return result
-

number-of-1-bits/HYUNAHKO.py

@@ -7,4 +7,3 @@ def hammingWeight(self, n: int) -> int:
                 result+=1
             n = n//2
         return result
-

product-of-array-except-self/HYUNAHKO.py

@@ -17,3 +17,24 @@ def productExceptSelf(self, nums: List[int]) -> List[int]:
 
         return result_list
 
+    
+
+class Solution:
+    def productExceptSelf(self, nums: List[int]) -> List[int]:
+        result_list = [0] * len(nums)
+        if len(nums) <2 or len(nums) > 1e5:
+            return None 
+        
+        for idx in range(0, len(nums)):
+            result = 1
+            for idx_left in range(0, idx):
+                result *= nums[idx_left]
+
+            for idx_right in range(idx+1, len(nums)):
+                result *= nums[idx_right]
+            
+            result_list[idx] = result
+
+
+        return result_list
+        

valid-palindrome/HYUNAHKO.py

@@ -9,5 +9,4 @@ def isPalindrome(self, s: str) -> bool:
             if (str1 != result[n-i-1]):
                 return False
         return True
-