Merge pull request #1105 from pooja-git11/patch-99

Create SolutionbyPooja.cpp

Dynamic Programming/Longest Common Subsequence/SolutionbyPooja.cpp

@@ -0,0 +1,58 @@
+/*
+    Given two sequences, find the length of longest subsequence present in both of them. A subsequence is a sequence that appears in the same relative order, but not
+    necessarily contiguous.
+
+    sequence1     :   ABCDGH
+    sequence2     :   AEDFHR
+    Output        :   3 -> {ADH is common in both sequences}
+*/
+
+#include<iostream>
+using namespace std;
+
+int max(int a, int b)
+{
+    if(a > b)
+        return a;
+    else
+        return b;
+}
+
+int Length_of_LongestCommonSubsequence(string X, string Y, int n, int m)
+{
+    int t[n + 1][m + 1];
+
+    for(int i =0; i < n + 1; i++)
+        t[i][0] = 0;
+
+    for(int i = 0; i < m + 1; i++)
+        t[0][i] = 0;
+
+    for(int i = 1; i < n + 1; i++)
+    {
+        for(int j = 1; j < m + 1; j++)
+        {
+             if(X[i - 1] == Y[j - 1])
+                t[i][j] = 1 + t[i - 1][j - 1];
+
+            else
+                t[i][j]= max(t[i - 1][j], t[i][j - 1]);
+        }
+    }
+
+    return t[n][m];
+}
+
+
+int main()
+{
+    string X,Y;
+
+    cout << "Enter first string  ";
+    cin >> X;
+
+    cout << "Enter second string ";
+    cin >> Y;
+
+    cout << Length_of_LongestCommonSubsequence(X, Y, X.size(), Y.size());
+}