Jump to content

Longest common subsequence: Difference between revisions

m
Undo revision 264428 by Patrica (talk) Not necessary to link to 3rd party sites that add no information, just pose the same task
(added source)
m (Undo revision 264428 by Patrica (talk) Not necessary to link to 3rd party sites that add no information, just pose the same task)
Line 9:
In this puzzle, your code only needs to deal with strings. Write a function which returns an LCS of two strings (case-sensitive). You don't need to show multiple LCS's.
 
For more information on this problem please see [https://www.interviewbit.com/problems/longest-common-prefix/ InterviewBit] & [[wp:Longest_common_subsequence_problem|Wikipedia]].
 
=={{header|Ada}}==
10,343

edits

Cookies help us deliver our services. By using our services, you agree to our use of cookies.