cpp-flashcards/org/study_deck_02/dsa/bit-manipulation/0231-power-of-two.org

• 0231. Power of Two
  • Approach
  • Python
  • C++

TODO 0231. 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 == 2^{x}.

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:

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

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

TODO Approach

Write your approach here.

TODO Python

class Solution:
    def isPowerOfTwo(self, n: int) -> bool:

TODO C++

class Solution {
public:
    bool isPowerOfTwo(int n) {
        
    }
};