Added Longest Common Subsequence solution to C++ folder

[anaghapuv]

Problem Statement: Given two strings text1 and text2, return the length of their longest common subsequence. If there is no common subsequence, return 0. A subsequence of a string is a new string generated from the original string with some characters (can be none) deleted without changing the relative order of the remaining characters.

Solution: To find the longest common subsequence in two strings :
We first make a dynamic programming table c, using a 2D array.
The first row and first column are initialized to zero.
If characters match the LCS increases by 1 (we increment the value of [i-1][j-1].
Otherwise, it takes the maximum LCS length and skips the character.
The final length is stored in c and that is what is returned.

Output:
Test Case 1: text1 = "abcde"; text2 = "ace": Output: 3
Test Case 2: text1 = "abc"; text2 = "abc": Output: 3
Test Case 3: text1 = "abc"; text2 = "def": Output: 0

I would really appreciate it if you accept this pull request and assign it under the appropriate Hacktoberfest 2024 tags before merging.
Thankyou!

[abhisek247767]

here two files there

[anaghapuv]

Oh, I am so sorry, I added the full form later on to avoid confusion

[anaghapuv]

Do i delete this and submit another pull request?

[abhisek247767]

Sure or if you wish do it here also