longest common subsequence ( lcs ) problem not able to
understand. Please Help me by providing it’s easy to
understand code
description: Given two sequences, find the length of
longest subsequence present in both of them. A
subsequence is a sequence that appears in the same
relative order, but not necessarily contiguous. For
example, “abc”, “abg”, “bdf”, “aeg”, ‘”acefg”, … etc are
subsequences of “abcdefg”.
input
char X[] = “AGGTAB”;
char Y[] = “GXTXAYB”;
output:
Length of LCS is 4