Leetcode - Power of Three Solution — The Poor Coder

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.

Example 1:

Text

Input: n = 27
Output: true

Example 2:

Text

Input: n = 0
Output: false

Example 3:

Text

Input: n = 9
Output: true

Example 4:

Text

Input: n = 45
Output: false

Constraints:

-2³¹ <= n <= 2³¹ - 1

Follow up: Could you solve it without loops/recursion?

Solution in python#

Python

class Solution:
    def isPowerOfThree(self, n: int) -> bool:
        if n <= 0:
            return False
        return (math.log10(n) / math.log10(3))%1 == 0

May 112021

Leetcode - Number of Good Pairs Solution

Given an array of integers nums. A pair (i,j) is called good if nums[i] == nums[j] and i < j. Return the number of good pairs. Example 1: Example 2: Example 3: Constraints: 1 <= nums.length <= 100 1 <= nums[i] <= 100…

leetcode array Hash Table1 min read

May 062021

Leetcode - Maximum 69 Number Solution

Given a positive integer num consisting only of digits 6 and 9. Return the maximum number you can get by changing at most one digit (6 becomes 9, and 9 becomes 6). Example 1: Example 2: Example 3: Constraints: 1 <= num…

leetcode Math1 min read

May 032021

Leetcode - Subtract the Product and Sum of Digits of an Integer Solution

Given an integer number n, return the difference between the product of its digits and the sum of its digits. Example 1: Example 2: Constraints: 1 <= n <= 10^5 Solution in Python

leetcode Math1 min read

Solution in python#

Related posts

Leetcode - Number of Good Pairs Solution

Leetcode - Maximum 69 Number Solution

Leetcode - Subtract the Product and Sum of Digits of an Integer Solution