Fast Bit Reversal for 32-bit Integers | Dataford Interview Questions

Write a function to reverse the bits of a 32-bit unsigned integer and optimize it for execution speed.

Implement reverse_bits(n), accepting an integer from 0 through 2^32 - 1 and returning the integer formed by reversing all 32 bits. Prefer a fixed sequence of bitwise operations over per-bit iteration. The result must remain within the unsigned 32-bit range.

Constraints

0 <= n <= 2^32 - 1
The input is interpreted as an unsigned 32-bit integer
Reverse exactly 32 bits, including leading zero bits

Function Signature

def reverse_bits(n):

Your question is Fast Bit Reversal for 32-bit Integers. 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

Write a function to reverse the bits of a 32-bit unsigned integer and optimize it for execution speed.

Constraints

0 <= n <= 2^32 - 1
The input is interpreted as an unsigned 32-bit integer
Reverse exactly 32 bits, including leading zero bits

Function Signature

def reverse_bits(n):

Your question is Fast Bit Reversal for 32-bit Integers. 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.