Should array indices start at 0 or 1? My compromise of 0.5 was rejected without, I thought, proper consideration. Stan Kelly-Bootle

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

Output

          	        
          	        

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

          	        
          	        				    


Comments



Please login to add comments.