Coin Change Problem

Can someone please help me to create a coin change function?

You are given coins of different denominations and a total amount of money amount . Write a function to compute the fewest number of coins that you need to make up that amount. If that amount of money cannot be made up by any combination of the coins, return -1 .

You may assume that you have an infinite number of each kind of coin.

Source: Leetcode

Why are we making n -1 if the amount is != 0?

I am sorry, I missed that part so this solution worked fine for [1,2,5] but for the more complex problems it is going towards -1 path even tho when there can be a solution.

For example: for this it's giving me -1 but the right answer is 20

This topic was automatically closed 90 days after the last reply. New replies are no longer allowed.