Notes

Longest Common Subsequence

The longest common subsequence of strings $s_1$ and $s_2$ is the longest string s such that s is a subsequence of both $s_1$ and $s_2$. i.e. we can get s by starting at some point in s1, reading through