Longest Common Subsequence

Try to solve the Longest Common Subsequence problem.


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.


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


Create a free account to view this lesson.

By signing up, you agree to Educative's Terms of Service and Privacy Policy