Will the time complexity of both the memoisation and DP approach of this question would be O(NT), where T is the number of denominations given and N is the amount that is to be changed in coins. Please confirm.
Time Complexity of Coin Change Problem
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.