32. Longest Common Subsequence

Medium

Topics

Hint

Understand Before Coding

Visualize This Problem

Open Visualizer

Draw Your Approach

Draw

Example 1:

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

Output: 3

Explanation: The longest common subsequence is "ace", which has a length of 3.

Example 2:

Input: text1 = "abc", text2 = "abc"

Output: 3

Explanation: The longest common subsequence is "abc", which has a length of 3.

Example 3:

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

Output: 0

Explanation: There is no common subsequence, so the length is 0.

Constraints:

•
•

Time Complexity

O(mn)

Space Complexity

O(mn)

32. Longest Common Subsequence

Understand Before Coding

Visualize This Problem

Draw Your Approach

Example 1:

Example 2:

Example 3:

Constraints:

Learn

Topics

Hint

Use Cases

32. Longest Common Subsequence

Understand Before Coding

Visualize This Problem

Draw Your Approach

Example 1:

Example 2:

Example 3:

Constraints:

Learn

Topics

Hint

Use Cases