Regarding the problem

#1

please explain the xor profit problem

I am not able to understand what we have to do ???

#2

hello @gargshivam2001 please read this:
An efficient solution is to consider pattern of binary values from L to R. We can see that first bit from L to R either changes from 0 to 1 or it stays 1 i.e. if we take the XOR of any two numbers for maximum value their first bit will be fixed which will be same as first bit of XOR of L and R itself. After observing the technique to get first bit, we can see that if we XOR L and R, the most significant bit of this XOR will tell us the maximum value we can achieve i.e. let XOR of L and R is 1xxx where x can be 0 or 1 then maximum XOR value we can get is 1111 because from L to R we have all possible combination of xxx and it is always possible to choose these bits in such a way from two numbers such that their XOR becomes all 1.
Here for you reference i am attaching the code:


please go through it and tell me if you dont understand anything .
Happy Learning !!

#3

could you please explain it with a example ???

#4

i have explained it in the above code.
see like in the above question there are two number given you have to find the pair whose xor result will evlauate to be maximum possible.

#5

why we are taking the first bit to be fixed ???

#6

hey @gargshivam2001 if you are having problem with that logic then you can go with this easy code.


if you have doubt in this you can ask here:
Happy Learning !!

#7

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.