LeetCode 1143 Longest Common Subsequence - Problem Statement

Find the length of the longest common subsequence of two strings.

A subsequence maintains relative order but doesn't need to be contiguous.

With text1 = "abcde", text2 = "ace":

• "ace" is a subsequence of both.
• Length: $3$.

With text1 = "abc", text2 = "abc":

• "abc" itself is common.
• Length: $3$.

With text1 = "abc", text2 = "def":

• No common characters.
• Length: $0$.

Constraints: $1 \le$ text1.length, text2.length $\le 1000$.