How are we getting time complexity as O(TN) in minimum coin change problem?

#1

And then why is the time complexity of min steps to one is O(N)?

#2

in min coin change we use Tabular DP (2D dp) so time complexity is O(TN)
but in min step to one 1D dp works : tim complexity O(N)

both questions are different from each other what is the confusion?

#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.