2-dimensional DP Example Problem: given two strings r and y, find the longest common subsequence (LCS) and print its length Example: 2: ABCBDAB y BDCABC BCAB" is the longest subsequence found in both sequences, so the answer is 4