2025-08-09 Daily Challenge

Posted on:
Posted modified:
In: DailyChallenge

Today I have done leetcode's August LeetCoding Challenge with cpp.

August LeetCoding Challenge 9

Description

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 == 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?

Solution

class Solution {
public:
  bool isPowerOfTwo(int n) {
    return n > 0 && !(n & (n - 1));
  }
};

// Accepted
// 1110/1110 cases passed (0 ms)
// Your runtime beats 100 % of cpp submissions
// Your memory usage beats 52.81 % of cpp submissions (7.8 MB)
Algorithm