Update ProdArrayExceptSelf.py

Blooverh · Blooverh · commit c3e02c2cca01 · 2023-07-20T22:08:57.000-05:00
diff --git a/LeetCode/ArraysAndHashing/ProdArrayExceptSelf.py b/LeetCode/ArraysAndHashing/ProdArrayExceptSelf.py
@@ -20,7 +20,7 @@ def productExceptSelf(self, nums: List[int]) -> List[int]:
         ans = [] #empty list that will contain the product
 
         for i in range(len(nums)): 
-            ans.append(leftProd[i] * rightProd[i]) #multiply noth arrays at the same index
+            ans.append(leftProd[i] * rightProd[i]) #multiply both arrays at the same index 
 
         return ans
             
