Problem - Power of Two

Given an integer $n$, return true if $n$ is a power of two. Otherwise, return false. An integer is a power of two if there exists an integer $x$ such that $n = 2^x$.

Examples: $1$ (which is $2^0$), $2$, $4$, $8$, $16$ are powers of two. $3$, $5$, $6$, $7$ are not. What property do powers of two have in binary?

Look at the binary: $1 = 1$, $2 = 10$, $4 = 100$, $8 = 1000$, $16 = 10000$. Every power of two has exactly one 1 bit. Non-powers have multiple 1 bits. How can you check for exactly one 1 bit?