Q. What is the main idea behind the dynamic programming approach to the Coin Change Problem?
-
A.
Using a greedy algorithm
-
B.
Finding the maximum number of coins
-
C.
Minimizing the number of coins needed to make a certain amount
-
D.
Sorting the coins
Solution
The dynamic programming approach to the Coin Change Problem focuses on minimizing the number of coins needed to make a specific amount.
Correct Answer:
C
— Minimizing the number of coins needed to make a certain amount
Learn More →
Showing 1 to 1 of 1 (1 Pages)
