Kadane's Algo, this works with -ve elements also

ClassicKadane.py

from math import inf

class Solution:
    def maxSubArray(self, nums: List[int]) -> int:
        curr_sum = -inf
        curr_max = -inf
        for num in nums:
            curr_sum = max(curr_sum + num, num)
            curr_max = max(curr_max, curr_sum)
        return curr_max

Kadane.py

class Solution:
    
    def maxSubArray(self, nums: List[int]) -> int:
        
        c = 0 # Current Max 
        m = float("-inf") # Max So Far
        
        # For each elements
        for num in nums:
            
            # Update Current Max
            c = c + num
            
            # Check if Current Max is less than current,
            # if yes, make current max equal to current
            if c < num:
                c = num
            
            # Mainitain maximum so far
            m = max(m,c)
        
        # return max so far
        return m