Strictly Palindromic Number — LeetCode 2396 Python Solution

The problem

An integer n is strictly palindromic if, for every base b between 2 and n - 2 (inclusive), the string representation of the integer n in base b is palindromic. Given an integer n, return true if n is strictly palindromic and false otherwise.

Example

Input

n = 9

Output

false

Explanation

In base 2: 9 = 1001 (base 2), which is palindromic.

Python solution

class Solution:
    def isStrictlyPalindromic(self, n: int) -> bool:
        return False

Complexity

Pattern: Two Pointers

Use the order already in the input to discard half the search space at every step. LeetCode 2396. Strictly Palindromic Number is filed here because LeetCode tags it Two Pointers, which is the vocabulary this hub collects.

The two pointers guide has the Python template for the pattern and the 201 LeetCode problems that use it.

Related problems