#2217

Find Palindrome With Fixed Length

expert · 1070 · lc medium +32 · verified · 38% accepted · 664 likes · top 17%

Description

You are given an integer array queries and a positive integer intLength. For each queries[i], find the queries[i]^th smallest positive palindrome that has exactly intLength digits, or -1 if no such palindrome exists.

A palindrome is a number that reads identically from left to right and right to left. Leading zeros are not allowed in palindromes.

Example 1:

Input: queries = [1,2,3,4,5,90], intLength = 3

Output: [101,111,121,131,141,999]

Explanation:

The first few palindromes of length 3 are:

101, 111, 121, 131, 141, 151, 161, 171, 181, 191, 202, ...

The 90th palindrome of length 3 is 999.

Example 2:

Input: queries = [2,4,6], intLength = 4

Output: [1111,1331,1551]

Explanation:

The first six palindromes of length 4 are:

1001, 1111, 1221, 1331, 1441, and 1551.

Code

1

2

3

class Solution:
    def kthPalindrome(self, queries: List[int], intLength: int) -> List[int]:

class Solution:
    def kthPalindrome(self, queries: List[int], intLength: int) -> List[int]: