Reverse Bits Without Lookup | Dataford Interview Questions

Write a C function to reverse the bits of a 32-bit unsigned integer without using a lookup table.

Implement the equivalent Python function reverse_bits(n) for grading. Return the unsigned 32-bit integer whose bit at position i equals the input bit at position 31 - i. The input is guaranteed to be within the 32-bit unsigned range.

Constraints

0 <= n <= 2^32 - 1
Process exactly 32 bit positions
Do not use a lookup table
Return an unsigned 32-bit result

Function Signature

def reverse_bits(n):

Your question is Reverse Bits Without Lookup. 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 C function to reverse the bits of a 32-bit unsigned integer without using a lookup table.

Constraints

0 <= n <= 2^32 - 1
Process exactly 32 bit positions
Do not use a lookup table
Return an unsigned 32-bit result

Function Signature

def reverse_bits(n):

Your question is Reverse Bits Without Lookup. 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.