Did daily's similar questions

Author: Zanger67

my-submissions/m53 v1.py

@@ -0,0 +1,8 @@
+class Solution:
+    def maxSubArray(self, nums: List[int]) -> int:
+        output = nums[0]
+        max_sum = nums[0]
+        for num in nums[1:] :
+            max_sum = max(max_sum + num, num)
+            output = max(max_sum, output)
+        return output

my-submissions/m53 v2.py

@@ -0,0 +1,8 @@
+class Solution:
+    def maxSubArray(self, nums: List[int]) -> int:
+        output = -inf
+        max_sum = -inf
+        for num in nums :
+            max_sum = max(max_sum + num, num)
+            output = max(max_sum, output)
+        return output

my-submissions/m53 v3.py

@@ -0,0 +1,4 @@
+class Solution:
+    def maxSubArray(self, nums: List[int]) -> int:
+        max_sum = -inf
+        return max((max_sum := max(max_sum + num, num)) for num in nums)

my-submissions/m53.md

@@ -0,0 +1,7 @@
+## V1/V2
+
+Standard appraoches
+
+## V3
+
+Oneliner attempt to optimize since built-in functions are coded in C.