238 Product of Array except itself

medium/238 Product of Array Except Self/solution.py

@@ -0,0 +1,18 @@
+class Solution:
+    def productExceptSelf(self, nums: list[int]) -> list[int]:
+        ans = [1] * len(nums)
+        curr = 1
+        for i in range(len(nums)):
+            ans[i] *= curr
+            curr *= nums[i]
+
+        curr = 1
+        for i in range(len(nums) - 1, -1, -1):
+            ans[i] *= curr
+            curr *= nums[i]
+        return ans
+
+if __name__ == "__main__":
+    test = Solution()
+
+    print(test.productExceptSelf([-1,1,0,-3,3]))

medium/53 Maximum Subarray/solution.py

@@ -0,0 +1,16 @@
+from math import inf
+
+def maxSubArray(nums):
+    max_sum = nums[0]
+    current_sum = nums[0]
+
+    for n in nums[1:]:
+        if current_sum < 0:
+            current_sum = 0
+        current_sum += n
+        if current_sum > max_sum:
+            max_sum = current_sum
+    return max_sum
+    
+if __name__ == "__main__":
+    print(maxSubArray([-2,1]))