Question: Don't need to write code. using dynamic programming solve the problem and construct the corresponding two dimension table for the algorithm and analyze the running

Don't need to write code. using dynamic programming solve the problem and construct the corresponding two dimension table for the algorithm and analyze the running time.
(2) Given coins of different denominations and a total amount. Write a function to calculate the minimum number of coins required to make up the total amount. If no coin combination can make up the total amount, return -1. (You can think that the number of coins of each type is unlimited) Sample input: coins =[1,2,5], amount =11 Sample output: 3 Explanation: 11=5+5+1
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
