30-day-leetcoding-challenge-528-week-1-3285.cpp

class Solution {
public:
    int maxSubArray(vector<int>& nums) {
        int size=nums.size();
         int max_so_far = INT_MIN;
        int max_ending_here = 0; 
  
    for (int i = 0; i < size; i++) 
    { 
        max_ending_here = max_ending_here + nums[i]; 
        if (max_so_far < max_ending_here) 
            max_so_far = max_ending_here; 
  
        if (max_ending_here < 0) 
            max_ending_here = 0; 
    } 
    return max_so_far;
    }
};