LIS finds the longest subsequence satisfying a condition within one sequence. But what about comparing two sequences? The next section covers Longest Common Subsequence (LCS (Longest Common Subsequence)) and Edit Distance.
You'll learn 2D DP where the state involves positions in both sequences. LCS asks: what's the longest subsequence common to both strings? Edit Distance asks: how many operations to transform one string into another? The "ending at" pattern from LIS becomes "matching positions" in LCS. Make sure you understand LIS reconstruction before moving on.