Problem - Power of Two

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

Examples: $1 = 2^0$, $2 = 2^1$, $4 = 2^2$, $16 = 2^4$. These are all powers of two. But $3$, $5$, $6$ are not.

This problem uses boolean logic with bitwise operations. Before reading on, think: what's special about the binary representation of powers of two?