We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
Whatever number is calculated in this way may not be in actual domain of possible values. How can correctness of this solution can be proved and verified.
Hi. I cannot provide a formal mathematical proof, mostly because it would probably take 4 paragraphs of explaining in detail. It's best to just see it always works by going through a few examples on your own.
A good thing to notice is that the number calculated will always be in the actual domain of possible values because my solution says "We first find the most significant bit that we can force to differ by looking at L and R." This is the main step that gets A and B to be in the correct domain.
Maximizing XOR
You are viewing a single comment's thread. Return to all comments →
Whatever number is calculated in this way may not be in actual domain of possible values. How can correctness of this solution can be proved and verified.
Hi. I cannot provide a formal mathematical proof, mostly because it would probably take 4 paragraphs of explaining in detail. It's best to just see it always works by going through a few examples on your own.
A good thing to notice is that the number calculated will always be in the actual domain of possible values because my solution says "We first find the most significant bit that we can force to differ by looking at L and R." This is the main step that gets A and B to be in the correct domain.
HackerRank solutions.
Thanks for explaining. A very few explain code well. Keep it up.