From b2da627ed9efbd27e33e867950d2ae49e51e1276 Mon Sep 17 00:00:00 2001
From: Harshit Sharma <55287441+harshit-3103@users.noreply.github.com>
Date: Tue, 31 Oct 2023 23:36:52 +0530
Subject: [PATCH] KedaneAlgorithms.cpp

---
 KedaneAlgorithms.cpp | 67 ++++++++++++++++++++++++++++++++++++++++++++
 1 file changed, 67 insertions(+)
 create mode 100644 KedaneAlgorithms.cpp

diff --git a/KedaneAlgorithms.cpp b/KedaneAlgorithms.cpp
new file mode 100644
index 00000000..c2a36ab2
--- /dev/null
+++ b/KedaneAlgorithms.cpp
@@ -0,0 +1,67 @@
+#include <vector>
+#include <bits/stdc++.h>
+using namespace std;
+
+// Kedane Algorithms: Maximum Subarray Sum 
+
+int maxSubArray(vector<int>& a){
+    int sum=0,  s = 0, end = 0, index = 0, x = a[0];
+    for(int i=0;i<a.size();i++){
+        sum += a[i];
+        if(x<sum){
+            x = sum;
+            s = index;
+            end = i;
+        }
+        if(sum<0){
+            sum = 0;
+            index++;
+        }
+    }
+    return x;
+}
+
+
+// Kedane Algorithms: Maximum Subarray Product
+
+int maxProdSubArray(vector<int>& a){
+        int cnt=INT_MIN;
+        int x=1;
+        for(int i=0;i<nums.size();i++)
+        {
+            x *=nums[i];
+            cnt=max(cnt,x);
+            if(x==0) x=1;
+        }
+        int n=1;
+        for(int i=nums.size()-1;i>=0;i--)
+        {
+            n*=nums[i];
+            cnt=max(cnt,n);
+            if(n==0) n=1;
+        }
+        return cnt;
+}
+
+
+int main()
+{
+    int t;
+    cin >> t;
+    while(t--)
+    {
+        int n,val;
+        cin>>n;
+        vector<int> a(n);
+            
+        for(int i=0;i<n;i++)
+        {
+            cin>>a[i];
+        }
+       
+        cout<<maxSubArray(a); 
+    }
+}
+
+
+