largest contiguous array sum solution added in dp folder.

Author: pranava7

Dynamic Programming/Largest Sum Contiguous Subarray.cpp

@@ -0,0 +1,27 @@
+// largest contiguous array sum
+#include <bits/stdc++.h>
+
+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() {
+  int a[] = {-2, -3, 4, -1, -2, 1, 5, -3};
+  int n = sizeof(a) / sizeof(a[0]);
+
+  int max_sum = maxSubArraySum(a, n);
+  cout << "Maximum contiguous sum is " << max_sum;
+  return 0;
+}