# Find Palindrome With Fixed Length Solution Leetcode

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: Find Palindrome With Fixed Length Solution Leetcode**

Input:queries = [1,2,3,4,5,90], intLength = 3Output:[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, 201, ... The 90^{th}palindrome of length 3 is 999.

**Example 2: Find Palindrome With Fixed Length Solution Leetcode**

Input:queries = [2,4,6], intLength = 4Output:[1111,1331,1551]Explanation:The first six palindromes of length 4 are: 1001, 1111, 1221, 1331, 1441, and 1551.

**Constraints: Find Palindrome With Fixed Length Solution Leetcode**

`1 <= queries.length <= 5 * 10`

^{4}`1 <= queries[i] <= 10`

^{9}`1 <= intLength <= 15`