From bab76ad2145492c75d510bfe48155e0eed112653 Mon Sep 17 00:00:00 2001
From: Deven <63876261+devenperez@users.noreply.github.com>
Date: Mon, 21 Oct 2024 09:13:24 -0400
Subject: [PATCH] Time: 38 ms (97.94%), Space: 25 MB (96.97%) - LeetHub

---
 .../0238-product-of-array-except-self.py          | 15 +++++++++++++++
 1 file changed, 15 insertions(+)
 create mode 100644 0238-product-of-array-except-self/0238-product-of-array-except-self.py

diff --git a/0238-product-of-array-except-self/0238-product-of-array-except-self.py b/0238-product-of-array-except-self/0238-product-of-array-except-self.py
new file mode 100644
index 0000000..2ae905d
--- /dev/null
+++ b/0238-product-of-array-except-self/0238-product-of-array-except-self.py
@@ -0,0 +1,15 @@
+class Solution:
+    def productExceptSelf(self, nums: List[int]) -> List[int]:
+        n = len(nums)
+
+        left = [1] * len(nums)
+        right = [1] * len(nums)
+
+        for i in range(len(nums)):
+            if i > 0:
+                left[i] = left[i - 1] * nums[i - 1]
+            
+            if n - i < len(nums):
+                right[n - i - 1] = right[n - i] * nums[n - i]
+
+        return [left[i] * right[i] for i in range(len(nums))]
\ No newline at end of file