Tap here to switch tabs
Problem
Submissions

Problem: Reverse Bits

Reverse Bits asks you to return the unsigned 32-bit integer formed by reversing the order of all 32 bits in the input, including leading zeros.

Statement

Given an unsigned 32-bit integer n, we need to calculate a 32-bit unsigned integer with reversed bits. When we say “reverse” we don’t mean flipping the 00s to 11s and vice versa, but simply reversing the order in which they appear, i.e., from left-to-right to right-to-left.

Constraints:

  • The input must be a binary string of length 3232
⋮
Tap here to switch tabs
Problem
Submissions

Problem: Reverse Bits

Reverse Bits asks you to return the unsigned 32-bit integer formed by reversing the order of all 32 bits in the input, including leading zeros.

Statement

Given an unsigned 32-bit integer n, we need to calculate a 32-bit unsigned integer with reversed bits. When we say “reverse” we don’t mean flipping the 00s to 11s and vice versa, but simply reversing the order in which they appear, i.e., from left-to-right to right-to-left.

Constraints:

  • The input must be a binary string of length 3232