Skip to content

Latest commit

 

History

History
12 lines (10 loc) · 539 Bytes

CommonSubsequence.md

File metadata and controls

12 lines (10 loc) · 539 Bytes

Common Subsequence

You are given two sequences. Write a program to determine the longest common subsequence between the two strings (each string can have a maximum length of 50 characters). NOTE: This subsequence need not be contiguous. The input file may contain empty lines, these need to be ignored. The first argument will be a path to a filename that contains two strings per line, semicolon delimited. You can assume that there is only one unique subsequence per test case.

Example Input

XMJYAUZ;MZJAWXU

Example Output

MJAU