Longest Common Subsequence

medium

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.

Test Cases

Copy an input into the main harness and Run to verify

Input

text1 = "abcde", text2 = "ace"

Expected Output

3

Explanation: The longest common subsequence is "ace".

Input

text1 = "abc", text2 = "abc"

Expected Output

3

Input

text1 = "abc", text2 = "def"

Expected Output

0

Constraints

1 <= text1.length, text2.length <= 1000
text1 and text2 consist of only lowercase English characters.

Hints

Hint 1 — click to reveal

If characters match, extend the LCS of the prefixes.

Hint 2 — click to reveal

If not, take the better of dropping a character from either string.

Java Compiler