The Change Making problem can be optimally solved using both greedy algorithms and dynamic programming, depending on the type of currency used in the question. We go over both cases, and build a recurrence around an efficient dynamic programming solution.
