Optimization by breaking problems into simpler sub-problems.
Classic introduction to DP. Compare Recursion, Memoization, and Tabulation.
Maximize value within a weight limit. Visualized using a tabulation grid.
Find the longest subsequence present in two sequences. Grid visualization.
Find the length of the longest strictly increasing subsequence.
Find minimum number of coins to make a distinct amount.
Calculate minimum operations to transform one string into another.