Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum.

// Kadane's algorithm

int maxSum(int arr[] , int n){

int sum;

int res;

sum = arr[0];

res = arr[0];

for(int i=1; i<n; i++){

sum = max(sum+arr[i] , arr[i]);

res = max(sum , res);

}

re...read more