The <b>longest common subsequence</b> (or <ahref="http://en.wikipedia.org/wiki/Longest_common_subsequence_problem"target="_blank"><b>LCS</b></a>) of groups A and B is the longest group of elements from A and B that are common between the two groups and in the same order in each group. For example, the sequences "1234" and "1224533324" have an LCS of "1234":
For more information on this problem please see <ahref="https://en.wikipedia.org/wiki/Longest_common_subsequence_problem"target="_black">Wikipedia</a>.
</section>
## Instructions
<sectionid='instructions'>
Write a case-sensitive function that returns the LCS of two strings. You don't need to show multiple LCS's.
</section>
## Tests
<sectionid='tests'>
``` yml
tests:
- text: <code>lcs</code> should be a function.
testString: assert(typeof lcs == 'function');
- text: <code>lcs("thisisatest", "testing123testing")</code> should return a string.