Description
Given two strings text1 and text2, return the length of their longest common subsequence. If there is no common subsequence, return 0.
Examples
Input:
text1 = "abcde", text2 = "ace"Output:
3Explanation:
LCS is "ace".
Input:
text1 = "abc", text2 = "def"Output:
0Explanation:
Edge case returning zero.
Input:
text1 = "programming", text2 = "algorithm"Output:
5Explanation:
The longest common subsequence is "rgrm" (characters at positions r-g-r-m in both strings). Other valid LCS include "agrm" and "rgam", but they all have the same maximum length of 5.
Constraints
- •
1 ≤ text1.length, text2.length ≤ 1000 - •
text1 and text2 consist of lowercase English characters.