Please help me in the problem of no of ways to have a coin change problem i am facing tle

#1

problem link->https://www.geeksforgeeks.org/coin-change-dp-7/

#2

@kailash_01 hey try to solve using dp because according to question it has these constraints
Expected Time Complexity: O(m*n).
Expected Auxiliary Space: O(n).
And by using recursion only gives tle as it has exponential time complexity

#3

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.