Given a 32-bit unsigned integer n, reverse its 32 bits and return the unsigned decimal value of the reversed bit pattern.

Note: Before attempting to solve the problem:

Read about signed vs. unsigned binary interpretation in Bitwise Description.
- Some languages, such as Java, do not have a native unsigned 32-bit integer type. In those languages, use a return type that can represent values from 0 to 2^32 - 1.

Read about two's complement in Bitwise Description.
- Two's complement is a method used to represent both positive and negative integers in binary form.

Example 1:

Input: n = 2147483648
Output: 1
Explanation:
n = 2147483648 is 10000000000000000000000000000000 in 32-bit binary.
After reversing the 32 bits, we get: 00000000000000000000000000000001
This reversed bit pattern equals 1 in decimal.

Example 2:

Input: n = 5
Output: 2684354560
Explanation:
n = 5 is 00000000000000000000000000000101 in 32-bit binary.
Reversed bits: 10100000000000000000000000000000
Decimal conversion:
1 × 2^31 + 0 × 2^30 + 1 × 2^29 + 0 × 2^28 +...+ 0 × 2^0 
2^31 + 2^29 = 2147483648 + 536870912 = 2684354560

Example 3:

Input: n = 43261596
Output: 964176192
Explanation:
n = 43261596 is 00000010100101000001111010011100 in 32-bit binary.
Reversed bits: 00111001011110000010100101000000, which equals 964176192 in decimal.

Constraints

0 <= n <= 2³²−1

n is treated as a fixed 32-bit unsigned integer

65. Reverse Bits