Subarray with Largest Sum(Optimized) (Kadane's Algorithm)

PHOTO EMBED

Tue May 28 2024 15:24:12 GMT+0000 (Coordinated Universal Time)

Saved by @ayushg103 #c++

int maxSubArray(vector<int>& nums)
{
    int sum=0;
    int maxi = INT_MIN;
    for(int i=0;i<nums.size();++i)
    {   sum+=nums[i];
        maxi = max(maxi,sum);
        if(sum<0)
        sum=0;
    }
    return maxi;
}
content_copyCOPY