Dynamic Programming (Advanced)

Step up from 1D DP to grid paths, subsequence problems on one or two arrays, and interval DP — the patterns behind LIS, LCS, and Matrix Chain Multiplication.