Dsa
Dynamic Programming
Easy
Coin Change Combinations
Given an amount and a list of coin denominations, find the number of combinations to make that amount. You can use each coin denomination an unlimited number of times. Implement a function that takes an integer amount and a list of integers coins as input and returns the number of combinations that can make the amount. The input consists of an integer followed by a list of integers (coin denominations). Output the number of different combinations.
Example:
Input:
5
1 2 5
Output:
4
Key concepts
dynamic_programmingcombinatorial
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