Find the length of the longest subsequence common to two sequences. Uses a 2D DP table: if characters match, extend the previous LCS; otherwise take the best of skipping one character from either string.
// tap NEXT STEP to walk through one step at a time