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

Sort by

recency

|

776 Discussions

|

  • somaditya
     + 0 comments

    2 line Java hackish solution:

    public static long flippingBits(long n) {
        long maxLong = 4294967295L;
        
        return -1 * (~n ^ maxLong) - 1;
    }

  • 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;
}

  • mohamad2006saif
     + 0 comments

    Python Solution

    1. 			MaxNumBin = ''.join('1' for _ in range(32))
2. 			MaxNumDec = int(MaxNumBin,2)
3. 			return MaxNumDec - n

  • shikhagupta12191
     + 0 comments

    Solution in JS:

    function flippingBits(n) {

    return (~n) >>> 0;

    }

  • merajhussain1
     + 0 comments

    A simple attempt using C++ bitset

    long flippingBits(long n) { std::bitset<32> bits(n); for(int i=0;i<32;i++){ bits.flip(i);
    } return bits.to_ullong(); }