Efficient 32-Bit Bit Reversal | Dataford Interview Questions

Write a function to reverse the bits of a 32-bit integer as efficiently as possible.

Implement reverse_bits(n), where n is an unsigned 32-bit integer. Return the unsigned 32-bit integer whose bits appear in reverse order. The implementation should use bitwise operations and must not convert the number to a string or use built-in reversal utilities.

Function Contract

Input: integer n, where 0 <= n <= 2^32 - 1
Output: an unsigned 32-bit integer with its bit order reversed

Constraints

0 <= n <= 2^32 - 1
The input is treated as exactly 32 bits
Use O(1) auxiliary space
Do not convert the integer to a string

Function Signature

def reverse_bits(n):

Your question is Efficient 32-Bit Bit Reversal. 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