enter name of the algorithm here
LONGEST COMMOM SUBSEQUENCE
Describe the algorithm
A brief description of what your algorithm does
LCS is a dynamic programming algorithm. Given 2 strings we've to find the longest common subsequence
ex : A = "abbcdef" , B = "acddfcb"
LCS = "adef"
Bijoy-007
commented
4 years ago
Title or Name of the Algorithm LCS
Describe the algorithm A brief description of what your algorithm does LCS is a dynamic programming algorithm. Given 2 strings we've to find the longest common subsequence ex : A = "abbcdef" , B = "acddfcb" LCS = "adef"