Maximizing XOR Discussions | Algorithms | HackerRank
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.
  1. Practice
  2. Algorithms
  3. Bit Manipulation
  4. Maximizing XOR
  5. Discussions

Maximizing XOR

  • jeremy_roy + 0 comments

    Solution in O(g) time, where g is the MSF of (l xor r). For a 32 bit unsigned integer, worst-case g would be 32 operations.

    int maxXor(int l, int r) 
{
    int a = l ^ r;
    int max = 0;
    while (a != 0)
    {
        max |= a;
        a = a >> 1;
    }
    return max;
}