Reverse Bits LeetCode Solution

Here, We see Reverse Bits problem Solution. This Leetcode problem is done in many programming languages like C++, Java, JavaScript, Python, etc., with different approaches.

Reverse Bits LeetCode Solution

Problem Statement ->

Reverse bits of a given 32 bits unsigned integer.

Note:

• Note that in some languages, such as Java, there is no unsigned integer type. In this case, both input and output will be given as a signed integer type. They should not affect your implementation, as the integer’s internal binary representation is the same, whether it is signed or unsigned.
• In Java, the compiler represents the signed integers using 2’s complement notation. Therefore, in Example 2 above, the input represents the signed integer -3 and the output represents the signed integer -1073741825.

Example 1:
Input: n = 00000010100101000001111010011100
Output:    964176192 (00111001011110000010100101000000)
Explanation: The input binary string 00000010100101000001111010011100 represents the unsigned integer 43261596, so return 964176192 which its binary representation is 00111001011110000010100101000000.

Example 2:
Input: n = 11111111111111111111111111111101
Output:   3221225471 (10111111111111111111111111111111)
Explanation: The input binary string 11111111111111111111111111111101 represents the unsigned integer 4294967293, so return 3221225471 which its binary representation is 10111111111111111111111111111111.

• C++ Solution
• Java Solution
• JavaScript Solution
• Python Solution

Reverse Bits Leetcode Solution C++ ->

class Solution {
public:
    uint32_t reverseBits(uint32_t n) {
        uint32_t res = 0;
        for (int i = 0; i < 31; i++) {
            res = (n % 2) + res << 1;
            n >>= 1;
        }
        return res + n % 2;
    }
};
Code language: C++ (cpp)

Reverse Bits Leetcode Solution Java ->

public class Solution {
    public int reverseBits(int n) {
        int res=0;
    for(int i=0;i<32;i++){
    	res= ( res << 1 ) | ( n & 1 );         
    	n = n >> 1;                  
    }
    return res;
    }
}
Code language: Java (java)

Reverse Bits Leetcode Solution JavaScript ->

var reverseBits = function(n) {
    return parseInt([...`${Number(n).toString(2)}`.padStart(32,0)].reverse().join(''),2)
};
Code language: JavaScript (javascript)

Reverse Bits Leetcode Solution Python ->

class Solution:
    def reverseBits(self, n):
        oribin='{0:032b}'.format(n)
        reversebin=oribin[::-1]
        return int(reversebin,2)
Code language: Python (python)