Skip to content

Practice Longest Common Subsequence

Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.

Medium#1143
LeetCode Problem

Longest Common Subsequence

StringDynamic Programming

Problem Statement

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. A common subsequence of two strings is a subsequence that is common to both strings.

Source: Longest Common Subsequence on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

Input
text1 = "abcde", text2 = "ace"
Output
3

# Example 2

Input
text1 = "abc", text2 = "abc"
Output
3

# Example 3

Input
text1 = "abc", text2 = "def"
Output
0

Constraints

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

Related LeetCode Problems

Practice more problems similar to Longest Common Subsequence.

3291 Minimum Number of Valid Strings to Form Target I Medium3292 Minimum Number of Valid Strings to Form Target II Hard3320 Count The Number of Winning Sequences Hard3615 Longest Palindromic Path in Graph Hard5 Longest Palindromic Substring Medium
← Previous User Activity for the Past 30 Days INext → Decrease Elements To Make Array Zigzag

Review your practice with PhantomCodeAI

After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.

Start Free