Solution: Reverse Bits

Let's solve the Reverse Bits problem using the Bitwise Manipulation pattern.

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:

  • 00 \leq n
...