Day 3 - Maximum subarray

Solution.py

# https://leetcode.com/explore/featured/card/30-day-leetcoding-challenge/528/week-1/3285/
class Solution:
    def maxSubArray(self, nums: List[int]) -> int:
        maxi = nums[0]
        tempSum = nums[0]
        
        for n in nums[1:]:
            if tempSum < 0:
                tempSum = n
            else:
                tempSum += n
            
            maxi = max(maxi, tempSum)
        return maxi