Update Product of Array Except Self - Leetcode 238.py

Author: gahogg

Product of Array Except Self - Leetcode 238/Product of Array Except Self - Leetcode 238.py

@@ -1,3 +1,24 @@
+# Brute Force Solution
+class Solution:
+    def productExceptSelf(self, nums: List[int]) -> List[int]:
+        n = len(nums)
+        ans = [0] * n
+
+        for i in range(n):
+            multiplier = 1
+            for j in range(n):
+                if i == j:
+                    continue
+                else:
+                    multiplier *= nums[j]
+            ans[i] = multiplier
+        
+        return ans
+        # Time: O(n^2)
+        # Space: O(n)
+
+
+# Optimal Solution
 class Solution:
     def productExceptSelf(self, nums: List[int]) -> List[int]:
         l_mult = 1