tomatocream
1dec88aaf2
Add populate-notes.mjs that fetches problem descriptions and Python/C++ code stubs from LeetCode's GraphQL API. Populated all 197 NeetCode 150 note files with: - Problem description (examples, constraints) - Python code stub (function signature) - C++ code stub (function signature + includes) API responses cached in leetcode/.cache/leetcode/ for instant re-runs.
945 B
945 B
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 = 1Example 2:
Input: n = 16
Output: true
Explanation: 24 = 16Example 3:
Input: n = 3
Output: falseConstraints:
-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) {
}
};