Bit Manipulation Swap Adjacent Bits | Dataford Interview Questions

Solve a bit manipulation problem: swap adjacent bits of a number.

Implement swap_adjacent_bits(n), where n is an unsigned 32-bit integer. Return the unsigned 32-bit integer formed by swapping bits 0 and 1, bits 2 and 3, and so on through bits 30 and 31.

Constraints

0 <= n <= 2^32 - 1
Bits are indexed from 0, with bit 0 as the least significant bit
Swap pairs are (0,1), (2,3), through (30,31)

Function Signature

def swap_adjacent_bits(n):

Your question is Bit Manipulation Swap Adjacent Bits. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem

Solve a bit manipulation problem: swap adjacent bits of a number.

Implement swap_adjacent_bits(n), where n is an unsigned 32-bit integer. Return the unsigned 32-bit integer formed by swapping bits 0 and 1, bits 2 and 3, and so on through bits 30 and 31.

Constraints

0 <= n <= 2^32 - 1
Bits are indexed from 0, with bit 0 as the least significant bit
Swap pairs are (0,1), (2,3), through (30,31)

Function Signature

def swap_adjacent_bits(n):

Your question is Bit Manipulation Swap Adjacent Bits. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.