Groups
Category
Divide and Conquer DP optimization speeds up DP transitions of the form dp[i][j] = min over k of dp[i-1][k] + C(k, j) when the optimal k is monotone in j.
Interval DP solves problems where the optimal answer for a segment [i, j] depends on answers of its subsegments.