Maximum Subarray Sum

Problem Link:

https://www.codingninjas.com/studio/problems/maximum-subarray-sum_630526

Hint :

Code:

long long maxSubarraySum(vector<int> arr, int n)
{
    // Write your code here.
    long long sum = 0;
    long long maxi = 0;
    for(int i=0;i<n;i++){
        sum+=arr[i];

        if(sum<0){
            sum = 0;
        }
        else{
            maxi = max(maxi,sum);
        }
    }

    return maxi;

}