Longest common subsequence: Difference between revisions
Content added Content deleted
m (copy edit - wiki link to wikipedia) |
m (WP link) |
||
Line 8:
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 please on this problem see [[wp:Longest_common_subsequence_problem|Wikipedia]].
=={{header|Ada}}==
| |||