DSAGeeks
Longest Common Subsequence Memoization
Medium

Problem Statement

Use top-down dynamic programming (memoization) to efficiently find the length of longest common subsequence between two sequences.

Examples

1Example 1
Input:
{ "s1": "AGGTAB", "s2": "GXTXAYB" }
Output:
4
2Example 2
Input:
{ "s1": "ABCDGH", "s2": "AEDFHR" }
Output:
3
3Example 3
Input:
{ "s1": "ABC", "s2": "AC" }
Output:
2
Loading...

Sign in to Run Code and Submit