Added new ques in Summer Vacation DSA sheet

DSA Sheets/SUMMER VACATION DSA PROBLEM SHEET/01. Arrays/A. Array Basics/04. Kadane's Algorithm/code.cpp

@@ -5,8 +5,45 @@ using namespace std;
 #define ld long double
 #define el "\n"
 
+/*
+1
+6
+-5 4 6 -3 4 -1
+*/
+
+//Using brute force approach ,Time Complexity: O(n^2)
+/*ll maxSubarraySum(int arr[], int n){
+  ll maxSum = LONG_LONG_MIN;
+
+  for (int i = 0; i < n; i++){
+    ll tempSum = arr[i];
+
+    for (int j = i + 1; j < n; j++){
+      tempSum += arr[j];
+
+      if (tempSum > maxSum)
+        maxSum = tempSum;
+    }
+  }
+
+  return maxSum;
+}*/
+
 ll maxSubarraySum(int arr[], int n){
+  ll maxSum = LONG_LONG_MIN;
+  ll currSum = 0;
+
+  for (int i = 0; i < n; i++){
+    currSum += arr[i];
+
+    if(currSum > maxSum)
+      maxSum = currSum;
+
+    if(currSum < 0)
+      currSum = 0;
+  }
 
+  return maxSum;
 }
 
 int main(){
@@ -22,8 +59,8 @@ int main(){
     int arr[n];
     for (int i = 0; i < n; i++)
       cin >> arr[i];
-    
-    cout << "Solution - " << maxSubarraySum(arr, n);
+
+    cout << "Solution - " << maxSubarraySum(arr, n) << el;
   }
 
   return 0;