Time: 264 ms (74.79%), Space: 26.3 MB (17.93%) - LeetHub

Author: Deepak5113

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

@@ -0,0 +1,23 @@
+class Solution:
+    def productExceptSelf(self, nums: List[int]) -> List[int]:
+        n = len(nums)
+        if n == 0:
+            return []
+
+        prefix_products = [1] * n
+        suffix_products = [1] * n
+
+        # Calculate prefix products
+        for i in range(1, n):
+            prefix_products[i] = prefix_products[i - 1] * nums[i - 1]
+
+        # Calculate suffix products
+        for i in range(n - 2, -1, -1):
+            suffix_products[i] = suffix_products[i + 1] * nums[i + 1]
+
+        # Calculate result by multiplying prefix and suffix products
+        result = [1] * n
+        for i in range(n):
+            result[i] = prefix_products[i] * suffix_products[i]
+
+        return result