Solution: Longest Common Subsequence
Explore how to solve the longest common subsequence problem by applying a top-down dynamic programming technique. Understand the use of memoization and a 2D table to optimize recursive solutions, improving performance by avoiding redundant calculations. This lesson helps you implement and analyze the algorithm's time and space complexities for coding interview success.
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:
-
str1.length