Solution: Power of Three
Understand how to verify if a number is a power of three by checking divisibility against the largest 32-bit power of three. Explore a solution that uses no loops or recursion and runs in constant time and space.
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