Bit Swapping

Given a 32 bit integer input x, swap its odd and even bits and return the resulting integer. (e.g., bit 0 and bit 1 are swapped, bit 2 and bit 3 are swapped, and so on).

For example:

x = 5, Binary code = 0101

swapOddEvenBits(5) --> 10

Binary representation of 10 = 1010

Need a hand? Try out these hints, one at a time.

Quick hint to get things rolling

The idea is to operate on the odd bits first, and then operate on the even bits. Subsequently, merge them with the bitwise OR | operator.

Final hint! You should be able to code the problem on viewing this.

1. First mask (clear) all the odd bits with 10101010 (0xAA) and shift them to the right by 1.

2. Mask all the even bits with 01010101 (0x55) and shift them to the left by 1.

3. Bitswise OR | the outputs of the first and second steps to reach the final result.

public int swapOddEvenBits(int x) {
    



}

This Coding Interview Question is available with an answer in the following programming languages :

Java

Python

Bit Swapping

Quick hint to get things rolling

Final hint! You should be able to code the problem on viewing this.

The interview prep tool you'll fall in love with!

This Coding Interview Question is available with an answer in the following programming languages :