DP: LCS and LIS

Two related problems are Longest Common Subsequence and Longest Increasing Subsequence. We can solve both of these using a standard DP pattern.

Slides