Final Example (#7): Longest Common Subsequence
Problem: given two strings (m and n), find the longest sequence of characters which appears in order in both strings
- lots of applications, DNA sequencing, blah, blah, blah
Example:
- “search me” and “insane method” = “same”