In this video the approach is discussed perfectley but the Time Complexity & Space Complexity are not explained!

#1

Can you please the Time & Space Complexity of this(Unique Number -III) problem.

Please explain in detail🙏

#2

See this,

image
image2160×1007 551 KB

We have made up a map of 64 bits, and for ever aj element we are storing it’s bit’s in each of it’s respective indexes. Then finding the unique number. So in worst case, time complexity will be shown in the figure
Code for reference

If have any doubt, feel free to ask here.

#3

Thank you so much for explaining Time Complexity in detail!!

#4

Can you please explain the Space Complexity,Also!!!

#5

It’s constant space only, we are taking only 64 int array, so you can say constant space with O(n) time complexity.

#6

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.