Medium · Dynamic Programming

Longest Common Subsequence

Given two strings text1 and text2, return the length of their longest common subsequence: the longest sequence of characters that appears in both strings in the same relative order, not necessarily contiguously (0 if they share no character).

{
  "a": "abcde",
  "b": "ace"
}

{
  "a": "abc",
  "b": "abc"
}