TJU - Tag
2013
-
▸
Change Making (Dynamic Programming) Problem
Classic dynamic programming problem to find the minimum number of coins needed to make a given change. Uses a bottom-up approach with sorted denominations to compute optimal solution.