Dynamic Programming: Longest Common Subsequence (LCS)

Problem Given two strings, find the length of their longest common subsequence. Tabulation Approach (2D DP)