Challenge: Money Change
Solve the Money Change Problem using a greedy approach.
We'll cover the following
Problem
Money Change Problem
Compute the minimum number of coins needed to change the given
value into coins with denominations , , and .
Input: An integer .
Output: The minimum number of coins with denominations , , and that change .
Level up your interview prep. Join Educative to access 70+ hands-on prep courses.