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.
1.0 KiB
1.0 KiB
TODO 1780. Check if Number is a Sum of Powers of Three medium
Given an integer n, return true if it is possible to represent /~n~ as the sum of distinct powers of three./ Otherwise, return false.
An integer y is a power of three if there exists an integer x such that y == 3^{x}.
Example 1:
Input: n = 12
Output: true
Explanation: 12 = 31 + 32Example 2:
Input: n = 91
Output: true
Explanation: 91 = 30 + 32 + 34Example 3:
Input: n = 21
Output: falseConstraints:
1 <= n <= 10^{7}
TODO Approach
Write your approach here.
TODO Python
class Solution:
def checkPowersOfThree(self, n: int) -> bool:TODO C++
class Solution {
public:
bool checkPowersOfThree(int n) {
}
};