Dsa
Dynamic Programming
Medium
Minimum Number of Coins
Given an integer amount and a list of coin denominations, determine the minimum number of coins required to make that amount. If it is not possible to make the amount with the given coins, return -1.
Example:
Input:
11
1 2 5
Output:
3
Key concepts
dynamic_programminggreedycoin_change
Practise this out loud — free
Start a mock interview on THIS exact question — a voice AI interviewer opens with it, pushes back like a real onsite, then hands you an instant scorecard.
🎙 Practise this question now