<a target="_blank" href="https://leetcode.com/problems/power-of-two/description/?envType=daily-question&amp;envId=2024-02-19">https://leetcode.com/problems/power-of-two/description/?envType=daily-question&amp;envId=2024-02-19</a>
<pre><code class="lang-javascript">/**
 * @param {number} n
 * @return {boolean}
 */
var isPowerOfTwo = function(n) {
 return n &gt; 0 &amp;&amp; (n &amp; n - 1) == 0
};
</code></pre>
To check if a number is a power of 2, it has to be greater than 0. Then we check if it's bitwise AND comparison with a number less by it by 1 returns 0, if it does then it is a power of two.

[https://leetcode.com/problems/power-of-two/description/?envType=daily-question&envId=2024-02-19](https://leetcode.com/problems/power-of-two/description/?envType=daily-question&envId=2024-02-19)

```javascript
/**
 * @param {number} n
 * @return {boolean}
 */
var isPowerOfTwo = function(n) {
    return n > 0 && (n & n - 1) == 0
};
```

To check if a number is a power of 2, it has to be greater than 0. Then we check if it's bitwise AND comparison with a number less by it by 1 returns 0, if it does then it is a power of two.

#231. Power of Two