Power of Three
Given an integer n, return true if it is a power of three. Otherwise, return false.
An integer n is a power of three if there exists an integer x such that n == 3^x.
Follow up: Could you solve it without loops/recursion?
Example 1
Input
n = 27Output
true27 = 3^3.
Example 2
Input
n = 0Output
falseThere is no x where 3^x = 0.
Constraints
- -2^31 <= n <= 2^31 - 1
Asked at 6 companies
Practice questions like this out loud in a mock coding interview with a live AI interviewer. First one free.