power-of-two

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

Algorithms

Given an integer <code>n</code>, return <code>true</code> if it is a power of two. Otherwise, return <code>false</code>.

An integer <code>n</code> is a power of two, if there exists an integer <code>x</code> such that <code>n == 2x</code>.

&nbsp;
Example 1:

<pre>
Input: n = 1
Output: true
Explanation: 20 = 1
</pre>

Example 2:

<pre>
Input: n = 16
Output: true
Explanation: 24 = 16
</pre>

Example 3:

<pre>
Input: n = 3
Output: false
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>-231 &lt;= n &lt;= 231 - 1</code></li>
</ul>

&nbsp;
Follow up: Could you solve it without loops/recursion?