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. Flipping bits
  2. Discussions

Flipping bits

Sort by

recency

|

163 Discussions

|

  • Premo
     + 0 comments

    i mean we can just return ~n & 0xFFFFFFFF.........thats it....you are all set

  • laxmikanth_s
     + 0 comments
    public static long flippingBits(long n) {
        // Create a mask with all bits set to 1
        long mask = 0xFFFFFFFFL; 

        // Flip all bits using XOR operation
        return n ^ mask;
    }

  • rodolfo_agosto
     + 0 comments

    Java:

    public static long flippingBits(long n) { // Write your code here return ~n & 0xFFFFFFFFL; }

  • akanniwilliams
     + 0 comments
    function flippingBits(n) {
    // Write your code here
    const maxBits = (2 ** 32) - 1
    return maxBits - n;
}

  • sanskar_agarwal3
     + 0 comments
    public static long flippingBits(long n) {
    // Write your code here
    long flip = 0;
    for(int i = 31; i>=0 ; i--){
        if(n- Math.pow(2,i)>=0){
            n-=Math.pow(2,i);
        }
        else{
            flip+=Math.pow(2,i);
        }
    }
    return flip;

    }