cpp-flashcards/org/study_deck_02/dsa/math-geometry/1780-check-if-number-is-a-sum-of-powers-of-three.org

• 1780. Check if Number is a Sum of Powers of Three
  • Approach
  • Python
  • C++

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 + 32

Example 2:

Input: n = 91
Output: true
Explanation: 91 = 30 + 32 + 34

Example 3:

Input: n = 21
Output: false

Constraints:

• 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) {
        
    }
};