Search
⌘K

Leetcode 326. Power of Three

Determine whether a given 32-bit signed integer is a power of three (i.e., equals 3^x for some integer x). Typical approaches use repeated division, logarithms (with precision care), or a no-loop check by testing divisibility against the largest 3^k within the 32-bit range.


Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Comments

Your account is free and you can post anonymously if you choose.