Question: Given an infinite supply of coins of different denominations and a total amount of money, write a function to compute the fewest number of coins
- Given an infinite supply of coins of different denominations and a total amount of money, write a function to compute the fewest number of coins needed to make up that amount. If it’s not possible to make up that amount, return -1. Implement this in a language of java dynamic programming for efficiency.
Step by Step Solution
There are 3 Steps involved in it
public class CoinChange public ... View full answer
Get step-by-step solutions from verified subject matter experts
