From 9e315141f4bdd521b7df5def8145f74a8b3c4aae Mon Sep 17 00:00:00 2001
From: Srishti Dubey <56927445+srieeee@users.noreply.github.com>
Date: Wed, 23 Oct 2019 20:57:34 +0530
Subject: [PATCH] Create longest-common-subsequence.cpp

---
 CPP/longest-common-subsequence.cpp | 36 ++++++++++++++++++++++++++++++
 1 file changed, 36 insertions(+)
 create mode 100644 CPP/longest-common-subsequence.cpp

diff --git a/CPP/longest-common-subsequence.cpp b/CPP/longest-common-subsequence.cpp
new file mode 100644
index 0000000..9cbd5bf
--- /dev/null
+++ b/CPP/longest-common-subsequence.cpp
@@ -0,0 +1,36 @@
+/* A Naive recursive implementation of LCS problem */
+#include <bits/stdc++.h> 
+using namespace std; 
+
+int max(int a, int b); 
+
+/* Returns length of LCS for X[0..m-1], Y[0..n-1] */
+int lcs( char *X, char *Y, int m, int n ) 
+{ 
+	if (m == 0 || n == 0) 
+		return 0; 
+	if (X[m-1] == Y[n-1]) 
+		return 1 + lcs(X, Y, m-1, n-1); 
+	else
+		return max(lcs(X, Y, m, n-1), lcs(X, Y, m-1, n)); 
+} 
+
+/* Utility function to get max of 2 integers */
+int max(int a, int b) 
+{ 
+	return (a > b)? a : b; 
+} 
+
+/* Driver code */
+int main() 
+{ 
+	char X[] = "AGGTAB"; 
+	char Y[] = "GXTXAYB"; 
+	
+	int m = strlen(X); 
+	int n = strlen(Y); 
+	
+	cout<<"Length of LCS is "<< lcs( X, Y, m, n ) ; 
+	
+	return 0; 
+}