About the complexity of xor max profit

#1

sir,I want to know about the explanation of time complexity that how we come to know that it is log(n).
I am already go through launchpad course but still not able to know about finding time complexities.
sir please also provide me some way to compute TC faster.

#2

@Ankit_kumar_3003
You traverse the binary of the numbers ( or you can say that you traverse all the bits in R) and that will be O(log R). so the time complexity is log(N)
if you are asking the explanation of time complexity of this problem, this means your basics are weak. try to think about the time it takes for each step, what could be their upper bounds. The best way is practise.
You can solve the Time complexity exercise on Interviewbit.

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