EXCHANGE COINS bottom up problem

#1


HOW can i solve it using bottom up dp.

#2

hello @mohitmahi123

no u cannot solve it using bottom up dp.
reason->
a) value of n can be upto 10^9 . we cannot declare array of 10^9 size because it will consume too much memory.
b) 10^9 iterations will take 10sec which will result in tle.