Solution: Power of Three
Understand how to identify whether an integer is a power of three by using a mathematical property of prime factors and the largest power of three within the 32-bit integer range. Learn to implement an efficient constant time solution that avoids loops and recursion by checking divisibility.
We'll cover the following...
We'll cover the following...
Statement
Given an integer n, determine whether it is a power of three. Return TRUE if it is, and FALSE otherwise.
An integer n is considered a power of three if there exists an integer x such that n