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

#+ANKI_DECK: study_deck_02
* TODO 1780. Check if Number is a Sum of Powers of Three :medium:
:PROPERTIES:
:NEETCODE: [[file:../../roadmap.org::*1780. Check if Number is a Sum of Powers of Three][1780. Check if Number is a Sum of Powers of Three]]
:END:

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:*


#+begin_src
Input: n = 12
Output: true
Explanation: 12 = 31 + 32
#+end_src


*Example 2:*


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


*Example 3:*


#+begin_src
Input: n = 21
Output: false
#+end_src


*Constraints:*

 - ~1 <= n <= 10^{7}~

** TODO Approach
Write your approach here.

** TODO Python
#+begin_src python :lc-problem 1780 :lc-lang python3
class Solution:
    def checkPowersOfThree(self, n: int) -> bool:
#+end_src

** TODO C++
#+begin_src cpp :lc-problem 1780
class Solution {
public:
    bool checkPowersOfThree(int n) {
        
    }
};
#+end_src