<h4 id="heading-reverse-bits-of-a-given-32-bits-unsigned-integer">Reverse bits of a given 32 bits unsigned integer</h4>
<hr />

Example 1: 
Input: n = 00000010100101000001111010011100 
Output: 964176192 (00111001011110000010100101000000) 
Explanation: The input binary string 00000010100101000001111010011100 represents the unsigned integer 43261596, so return 964176192 which its binary representation is 00111001011110000010100101000000.
Example 2: 
Input: n = 11111111111111111111111111111101 
Output: 3221225471 (10111111111111111111111111111111) 
Explanation: The input binary string 11111111111111111111111111111101 represents the unsigned integer 4294967293, so return 3221225471 which its binary representation is 10111111111111111111111111111111.
<hr />
<pre><code>class Solution:
 def reverseBits(self, n: int) -&gt; int:
 res = 0
 for i in range(32):
 res = res &lt;&lt; 1
 bit = n%2
 res += bit
 n = n &gt;&gt; 1
 return res
</code></pre>

#### Reverse bits of a given 32 bits unsigned integer
<hr>

Example 1: 
Input: n = 00000010100101000001111010011100 
Output: 964176192 (00111001011110000010100101000000) 
Explanation: The input binary string 00000010100101000001111010011100 represents the unsigned integer 43261596, so return 964176192 which its binary representation is 00111001011110000010100101000000.

Example 2: 
Input: n = 11111111111111111111111111111101 
Output: 3221225471 (10111111111111111111111111111111) 
Explanation: The input binary string 11111111111111111111111111111101 represents the unsigned integer 4294967293, so return 3221225471 which its binary representation is 10111111111111111111111111111111.
<hr>
```
class Solution:
 def reverseBits(self, n: int) -> int:
 res = 0
 for i in range(32):
 res = res << 1
 bit = n%2
 res += bit
 n = n >> 1
 return res
```

13. Reverse Bits

Reverse bits of a given 32 bits unsigned integer