- Given two strings sting-1 and string-2, 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. For example, "ace" is a subsequence of "abcde". A common subsequence of two strings is a subsequence that is common to both strings.
- As a programmer you should use "dynamic approach" to solve this problem.
- Sample Input and Output:
- string1 =" VITCHENNAI"
- string2 =" VITVELLORE"
- 2 --> sample output
You can edit this paste and save as new: