Merge pull request #509 from pranava7/main

LCSubstring solution added

Author: gantavyamalviya

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;
+}

Dynamic Programming/Longest-Common-Substring.cpp

@@ -0,0 +1,35 @@
+/* Dynamic Programming solution to find length of the longest common substring*/ 
+#include <bits/stdc++.h>
+
+using namespace std;
+
+int LongestCommonSubStr(string X, string Y, int m, int n) {
+
+  int dp[m + 1][n + 1];
+  int result = 0;
+
+  for (int i = 0; i <= m; i++) {
+    for (int j = 0; j <= n; j++) {
+      if (i == 0 || j == 0)
+        dp[i][j] = 0;
+
+      else if (X[i - 1] == Y[j - 1]) {
+        dp[i][j] = dp[i - 1][j - 1] + 1;
+        result = max(result, dp[i][j]);
+      } else
+        dp[i][j] = 0;
+    }
+  }
+  return result;
+}
+
+int main() {
+  string X = "FirstCommit";
+  string Y = "LastCommit";
+
+  int m = X.length();
+  int n = Y.length();
+
+  cout << "Length of Longest Common Substring is " << LongestCommonSubStr(X, Y, m, n);
+  return 0;
+}