Final resolve merge conflict

Author: HYUNAHKO

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

@@ -16,25 +16,4 @@ def productExceptSelf(self, nums: List[int]) -> List[int]:
             p *= nums[i] 
 
         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,4 +9,3 @@ def isPalindrome(self, s: str) -> bool:
             if (str1 != result[n-i-1]):
                 return False
         return True
-