coin change problem is a classic dynamic programming question and is asked in many interviews .
problem statement :
Given an integer array coins representing coins of different denominations and an integer amount representing a total amount of money.
Return the fewest number of coins that make up that amount. Assume infinite number of each kind of coin.
Ananya9878
commented
3 years ago
coin change problem is a classic dynamic programming question and is asked in many interviews .
problem statement : Given an integer array coins representing coins of different denominations and an integer amount representing a total amount of money. Return the fewest number of coins that make up that amount. Assume infinite number of each kind of coin.