Question

what is Lcs......??​

Answer 1

Answer:

The longest common subsequence problem is the problem of finding the longest subsequence common to all sequences in a set of sequences. It differs from the longest common substring problem.....

hope it helps........

Ok dear..................❤️❤️

Good night sweet dreams and TC

Answer 2

Answer:

The longest common subsequence problem is the problem of finding the longest subsequence common to all sequences in a set of sequences. It differs from the longest common substring problem: unlike substrings, subsequences are not required to occupy consecutive positions within the

hope it's help you ☺️☺️☺️