2-D Dynamic Programming

2-D Dynamic Programming involves solving optimization problems by breaking them down into simpler subproblems and storing the results of these subproblems in a 2-dimensional array. This is common for problems involving grids, matrices, or comparing two strings/arrays.