diff --git a/3.cpp b/3.cpp
new file mode 100644
index 0000000..b98fa26
--- /dev/null
+++ b/3.cpp
@@ -0,0 +1,36 @@
+//Author: Abhya Tripathi
+
+#include <iostream>
+using namespace std;
+int maxSubArraySum(int a[], int size) 
+{ 
+    int max_so_far = INT_MIN, max_ending_here = 0; 
+ 
+    for (int i = 0; i < size; i++) 
+    { 
+        max_ending_here = max_ending_here + a[i]; 
+        if (max_so_far < max_ending_here) 
+            max_so_far = max_ending_here; 
+ 
+        if (max_ending_here < 0) 
+            max_ending_here = 0; 
+    } 
+    return max_so_far; 
+} 
+int main() {
+	// your code goes here
+	int t;
+	cin>>t;
+	while(t--)
+	{
+		int n;
+		cin>>n;
+		int arr[n];
+		for(int i=0;i<n;i++)
+		{
+			cin>>arr[i];	
+		}
+		cout<<maxSubArraySum(arr,n)<<endl;
+	}
+	return 0;
+}
diff --git a/sol3.cpp b/sol3.cpp
new file mode 100644
index 0000000..fb6a60d
--- /dev/null
+++ b/sol3.cpp
@@ -0,0 +1,36 @@
+//Author: Abhya Tripathi
+
+#include <iostream>
+using namespace std;
+int maxSubArraySum(int a[], int size) 
+{ 
+    int max_so_far = INT_MIN, max_ending_here = 0; 
+
+    for (int i = 0; i < size; i++) 
+    { 
+        max_ending_here = max_ending_here + a[i]; 
+        if (max_so_far < max_ending_here) 
+            max_so_far = max_ending_here; 
+
+        if (max_ending_here < 0) 
+            max_ending_here = 0; 
+    } 
+    return max_so_far; 
+} 
+int main() {
+	// your code goes here
+	int t;
+	cin>>t;
+	while(t--)
+	{
+		int n;
+		cin>>n;
+		int arr[n];
+		for(int i=0;i<n;i++)
+		{
+			cin>>arr[i];	
+		}
+		cout<<maxSubArraySum(arr,n)<<endl;
+	}
+	return 0;
+}