From 28808e8ef99a5a9b0e45dcfd3355bb9627e34096 Mon Sep 17 00:00:00 2001 From: Shaikh Israil Date: Tue, 17 Feb 2026 19:56:29 -0800 Subject: [PATCH 1/3] product of array except itself --- leetcode-238.py | 32 ++++++++++++++++++++++++++++++++ 1 file changed, 32 insertions(+) create mode 100644 leetcode-238.py diff --git a/leetcode-238.py b/leetcode-238.py new file mode 100644 index 00000000..2ceb62a4 --- /dev/null +++ b/leetcode-238.py @@ -0,0 +1,32 @@ +''' +238. Product of Array Except Self +https://leetcode.com/problems/product-of-array-except-self/description/ + +Time Complexity: O(n) +Space Complexity: O(n) + + +''' + +class Solution: + def productExceptSelf(self, nums: List[int]) -> List[int]: + + if len(nums) == 2: + return nums[::-1] + + left, right = [1]*len(nums), [1]*len(nums) + + for i in range(1, len(nums)): + left[i] = left[i-1] * nums[i-1] + + + tmp = 1 + for j in range(len(nums)-2,-1,-1): + right[j] = right[j+1] * nums[j+1] + + + res = [] + for i in range(len(nums)): + res.append(left[i] * right[i]) + + return res From 860e624d698589e9b4715830c84079bd1006af58 Mon Sep 17 00:00:00 2001 From: Shaikh Israil Date: Tue, 17 Feb 2026 21:04:30 -0800 Subject: [PATCH 2/3] spiral matrix --- leetcode-54.py | 0 1 file changed, 0 insertions(+), 0 deletions(-) create mode 100644 leetcode-54.py diff --git a/leetcode-54.py b/leetcode-54.py new file mode 100644 index 00000000..e69de29b From 0e86886a51e3eb9107f536d3c7f5984fd7b74b60 Mon Sep 17 00:00:00 2001 From: Shaikh Israil Date: Tue, 17 Feb 2026 21:29:17 -0800 Subject: [PATCH 3/3] diagonal traverse of matrix --- leetcode-498.py | 0 1 file changed, 0 insertions(+), 0 deletions(-) create mode 100644 leetcode-498.py diff --git a/leetcode-498.py b/leetcode-498.py new file mode 100644 index 00000000..e69de29b