Problem: Reverse Bits

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 $0$s to $1$s 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 $32$