# Check If Number Is A Sum Of Powers Of Three: Explained
Check If Number Is A Sum Of Powers Of Three shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
n is a sum of distinct powers of 3 iff its base-3 representation has only digits 0 and 1 (no 2). Repeatedly divide by 3 and reject a remainder of 2.
## Steps to say out loud
1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (binary search on the answer, monotonic stack or deque, interval / interval-DP, string hashing, graph traversal, or shortest paths) and why a nested scan or naive search fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.
## Complexity
O(log n).
## Common mistake
Allowing repeated powers (that would be base 3 with digits > 1) or confusing this with sums of powers of two.
## Practice tip
Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at www.linkjob.ai.