class Solution{

    // arr: input array

    // n: size of array

    //Function to find the sum of contiguous subarray with maximum sum.

    long maxSubarraySum(int arr[], int n){

        // Your code here

        long currentSum = 0;

        long maxSum = Long.MIN_VALUE;

        for(int index = 0; index < n; index++) {

            currentSum += arr[index];

            maxSum = Math.max(currentSum, maxSum);

            if(currentSum < 0) currentSum = 0;

        }

        return maxSum;

    }

}