# Coin Change - Combinations - 1 #### Try First, Check Solution later

1. You should first read the question and watch the question video.
2. Think of a solution approach, then try and submit the question on editor tab.
3. We strongly advise you to watch the solution video for prescribed approach.

`1. You are given a number n, representing the count of coins.2. You are given n numbers, representing the denominations of n coins.3. You are given a number "amt".4. You are required to calculate and print the combinations of the n coins (non-duplicate) using      which the amount "amt" can be paid.Note -> Use the code snippet and follow the algorithm discussed in question video. The judge can't                force you but the intention is to teach a concept. Play in spirit of the question.`
Input Format
`A number nn1n2.. n number of elementsA number amt`
Output Format
`Check the sample output and question video`
Question Video
Constraints
`1 <= n <= 300 <= n1, n2, .. n elements <= 200 <= amt <= 50`
Sample Input
`52356712`
Sample Output
`2-3-7-.5-7-.`

• Related Topics

Run

Run
Id Name