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. Prepare
  2. Algorithms
  3. Bit Manipulation
  4. Flipping bits
  5. Discussions

Flipping bits

  • alban_tyrex
     + 0 comments

    Here is my c++ solution, you can watch the video explanation here : https://youtu.be/eZ0lTIzOjhQ

    V1

    long flippingBits(long n) {
    long result = 0;
    for(int i = 31; i >= 0; i--) {
        if(n >= pow(2, i)){
            n -= pow(2,i);
        }
        else result += pow(2, i);
    }
    return result;
}

    V2

    long flippingBits(long n) {
    return 4294967295 ^ n;
}