← Back to companies
[ OK ] Loaded —
[ INFO ]
$ cd
$ ls -lt
01
02
03
04
05
$ ls -lt
01
02
03
04
05
user@intervues:~/$
You are 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 you need to make up that amount. If that amount cannot be made up by any combination of coins, return -1.
You may assume that you have an infinite number of each kind of coin.
Key Insight: Use DP where dp[i] = minimum coins needed for amount i. For each coin, dp[i] = min(dp[i], dp[i-coin] + 1).