Solution.py

class Solution:
    def maxSubArray(self, nums: List[int]) -> int:
        solutions = []
        bestSolution = -sys.maxsize - 1
        for i in range(0, len(nums)):
            num = nums[i]
            prevSolution = 0
            if(i > 0):
                prevSolution = solutions[i - 1]
                
            if(prevSolution + num > num):
                solutions.append(prevSolution + num)
            else:
                solutions.append(num)
                
            if(solutions[i] > bestSolution):
                bestSolution = solutions[i]
                
        return bestSolution