Reverse Bits

Try solving the Reverse Bits problem.

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

Examples

Create a free account to view this lesson.

By signing up, you agree to Educative's Terms of Service and Privacy Policy