How to solve Minimum Coin Change Problem using bottom up dp? asked 08 Feb '17, 11:46

For bottom up solution, you can start filling the values from 0 and then maintaining a dp table fill the values for all the values upto n.
For more explanation check the GeeksForGeeks Solution. Please note Geeks For Geeks Solution is for total no of ways, for minimum coins just replace x+y with min(x,y). answered 08 Feb '17, 22:29
I want to the minimum numbers of coins to fulfill amount .
(09 Feb '17, 10:08)
1
table[i][j] = min(x,y), will give you the minimum amount to fulfil amount i using coins upto value S[j]. So table[n][m1] will give you minimum amount to fulfill n using coins upto S[m1] i.e. all the coins.
(09 Feb '17, 10:35)
