Solution: Power of Three
Understand how to verify whether an integer is a power of three by using a mathematical approach based on prime factors. Learn to implement a constant time solution without loops or recursion by checking divisibility against the highest power of three within 32-bit integer limits.
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