Solving The Minimum Coin Problem 3 Different Ways

Using Recursion, Memoization and Tabulation

What’s the minimum number of coins we can use to return a certain amount of change?

This is a classing dynamic programming problem that goes something like this:

“Given a list of coin values (e.g. 1¢, 5¢, 10¢, 25¢) what’s the minimum number of coins you can use to return a specified amount (e.g. 59¢)?