Coin change problem

#1

i dont know where i am doing the mistake


getting only 2 test case correct . rest are wrong

#2

you will get a tle with this approach.
do it using tabular dp method.

#3

but the top down dp and bottom up dp have nearly same time complexicity na except some call stack.
then how i am getting tle

#4

n is 1000000.
your dp array is iniatialised till 10000.

#5

i am not able to form 2d dp array of that size (says internal error))

#6

u can make 2d array of max size 10^4 globally
int dp[1000][10000]