solve(n) — treat n (0 <= n < 2^32) as an unsigned 32-bit integer, reverse the
order of its 32 bits and return the result, also as an unsigned number.
Peel the lowest bit of n off with n & 1, push it onto the result with a left shift,
and shift n right. Do it exactly 32 times, even if `n` runs out of ones early — the
leading zeros of n become trailing zeros of the result. In JavaScript use >>> 0 (and>>> for the shifts) to stay unsigned.
Examples
solve(43261596) → 964176192 // 00000010100101000001111010011100 reversed
solve(4294967293) → 3221225471
solve(1) → 2147483648Sample tests