Tap here to switch tabs
Problem
Submissions

Problem: Longest Common Subsequence

Longest Common Subsequence compares two strings and asks for the length of the longest sequence of characters they share in the same relative order, or zero if none exists.

Statement

Suppose you are given two strings. You need to find the length of the longest common subsequence between these two strings.

A subsequence is a string formed by removing some characters from the original string while maintaining the relative position of the remaining characters. For example, “abd” is a subsequence of “abcd”, where the removed character is “c”.

If there is no common subsequence, then return 0.

Constraints:

  • 1≤1 \leq str1.length ≤500\leq 500
  • 1≤1 \leq str2.length ≤500\leq 500
  • str1 and str2 contain only lowercase English characters.
⋮
Tap here to switch tabs
Problem
Submissions

Problem: Longest Common Subsequence

Longest Common Subsequence compares two strings and asks for the length of the longest sequence of characters they share in the same relative order, or zero if none exists.

Statement

Suppose you are given two strings. You need to find the length of the longest common subsequence between these two strings.

A subsequence is a string formed by removing some characters from the original string while maintaining the relative position of the remaining characters. For example, “abd” is a subsequence of “abcd”, where the removed character is “c”.

If there is no common subsequence, then return 0.

Constraints:

  • 1≤1 \leq str1.length ≤500\leq 500
  • 1≤1 \leq str2.length ≤500\leq 500
  • str1 and str2 contain only lowercase English characters.