As 2^n*N is space of DP But how sir say N! after Optimisation it will be O((2^N)N) ?? How
After Optimisation How Sir Has calculated Time Complexity
at what time u are referring to in video??
27 min 30sec time complexity reduce
because we are using bitmasking over here…
and sir said O((2^N)N) only… listen it once more…
I mean how sir has calculated timecomplexity by using dp matrix
he has explained it… pls go through video once again
O((2^N)N) is space complexity of DP matrix, ok i will go through video once more.
yes… all ur doubts would be cleared then
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.