how the time complexity of coin change problem becomes O(TN)
T->no of elements in array
Coin change problem
We are using two nested loop in which one loop will go from 1 to n and second loop go from 1 to t. So time complexity is n^2
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.