Package g2201_2300.s2217_find_palindrome_with_fixed_length

Class Solution

java.lang.Object
g2201_2300.s2217_find_palindrome_with_fixed_length.Solution
public class Solution extends java.lang.Object
2217 - Find Palindrome With Fixed Length.

Medium

Given an integer array queries and a positive integer intLength, return an array answer where answer[i] is either the queries[i]th smallest positive palindrome of length intLength or -1 if no such palindrome exists.

A palindrome is a number that reads the same backwards and forwards. Palindromes cannot have leading zeros.

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.

Constraints:

  • 1 <= queries.length <= 5 * 104
  • 1 <= queries[i] <= 109
  • 1 <= intLength <= 15

  • Constructor Summary

    Constructors
    Constructor
    Description
    Solution()
     

  • Method Summary

    Modifier and Type
    Method
    Description
    long[]
    kthPalindrome(int[] queries, int intLength)
     

    Methods inherited from class java.lang.Object

    clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

  • Constructor Details

    • Solution

      public Solution()

  • Method Details

    • kthPalindrome

      public long[] kthPalindrome(int[] queries, int intLength)