The longest common subsequence (LCS) is a common dynamic programming problem . LCS is defined as the longest subsequence that is common to all the given sequences, provided that the elements of the subsequence are not required to occupy consecutive positions within the original sequences.
@Lakhankumawat Can you please assign this issue to me ,I would like to work on it.
I'm a GSSoC 2022 participant.
Description
The longest common subsequence (LCS) is a common dynamic programming problem . LCS is defined as the longest subsequence that is common to all the given sequences, provided that the elements of the subsequence are not required to occupy consecutive positions within the original sequences. @Lakhankumawat Can you please assign this issue to me ,I would like to work on it. I'm a GSSoC 2022 participant.
Domain
Algorithm
Type of Contribution
Addition
Code of Conduct