Dynamic Programming (2D)

Extend DP to two-dimensional state spaces: grid path counting, two-string comparison (LCS, edit distance), and 2D knapsack variants. Master the dp[i][j] table, understand how to set up base cases for rows and columns, and optimize space with rolling arrays.