Skip to content

231. Power Of Two

Math Bit Manipulation Recursion

Problem - Power Of Two

Easy

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 == 2x.

 

Example 1:

Input: n = 1
Output: true
Explanation: 20 = 1

Example 2:

Input: n = 16
Output: true
Explanation: 24 = 16

Example 3:

Input: n = 3
Output: false

 

Constraints:

  • -231 <= n <= 231 - 1

 

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

Solutions

1
2
3
4
5
6
7
class Solution:
    def isPowerOfTwo(self, n: int) -> bool:
        bitwise_opperation = (n & (n - 1)) == 0
        if n > 0:
            return bitwise_opperation
        else:
            return False

Submission Stats:

  • Runtime: 0 ms (100.00%)
  • Memory: 17.8 MB (55.74%)