There are two ways of constructing a software design: One way is to make it so simple that there are obviously no deficiencies, and the other way is to make it so complicated that there are no obvious deficiencies. The first method is far more difficult. C.A.R. Hoare

Longest common subsequence

Language Java | Level Intermediate | Category Algorithms | August 4, 2015 9:05 am

Algorithm Problem Description

Longest common subsequence (LCS) problem is the problem of finding the longest subsequence common to all sequences in a set of sequences

Given two string and find the common sentence in the both



Longest Common String of 'Hello' and 'Helloworld' using dynamic programming = 5



Please login to add comments.