Coding Trainer
Reverse Bits
Problem
Reverse Bits
Given a 32-bit unsigned integer n, return the integer obtained by reversing the bits of n.
Example 1:
Input: n = 00000010100101000001111010011100
Output: 964176192 (00111001011110000010100101000000)
Example 2:
Input: n = 11111111111111111111111111111101
Output: 3221225471 (10111111111111111111111111111111)
Constraints:
- The input must be a binary string of length 32