# 190. Reverse Bits

Reverse bits of a given 32 bits unsigned integer.

• In Java, the compiler represents the signed integers using 2’s complement notation. Therefore, in Example 2 above, the input represents the signed integer `-3` and the output represents the signed integer `-1073741825`.
`Input: n = 00000010100101000001111010011100Output:    964176192 (00111001011110000010100101000000)Explanation: The input binary string 00000010100101000001111010011100 represents the unsigned integer 43261596, so return 964176192 which its binary representation is 00111001011110000010100101000000.`
`Input: n = 11111111111111111111111111111101Output:   3221225471 (10111111111111111111111111111111)Explanation: The input binary string 11111111111111111111111111111101 represents the unsigned integer 4294967293, so return 3221225471 which its binary representation is 10111111111111111111111111111111.`

# 136. Single Number

Given a non-empty array of integers `nums`, every element appears twice except for one. Find that single one.

`Input: nums = [2,2,1]Output: 1`
`Input: nums = [4,1,2,1,2]Output: 4`
`Input: nums = Output: 1`
• `-3 * 104 <= nums[i] <= 3 * 104`
• Each element in the array appears twice except for one element which appears only once.

--

--