Longest Common Subsequence

Given two strings text1 and text2, return the length of their longest common subsequence. A subsequence of a string is a new string generated from the original string with some characters deleted without changing the relative order of the remaining characters. A common subsequence of two strings is a subsequence that is common to both strings. If there is no common subsequence, return 0.

Constraints

  • 1 <= text1.length, text2.length <= 1000
  • text1 and text2 consist of only lowercase English characters.
View editorial solution
Saving… · 2 lines
class Solution:
def longestCommonSubsequence(self, text1: str, text2: str) -> int:
Console

Click Run to execute sample tests.