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.

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

Example 1
Inputn = 1
Outputtrue
2^0 = 1.
Example 2
Inputn = 16
Outputtrue
2^4 = 16.

Constraints

  • -2^31 <= n <= 2^31 - 1

Asked at 11 companies

Practice questions like this out loud in a mock coding interview with a live AI interviewer. First one free.

Your Solution

(Ctrl/Cmd + Enter)

Switching Language

Loading template...

Sign in to save your progress

AI code evaluation

Get a correctness verdict, what to keep, what's wrong, and the complexity of your solution.

Sign in to evaluate