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

<p>A <strong>palindrome</strong> is a number that reads the same backwards and forwards. Palindromes cannot have leading zeros.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> queries = [1,2,3,4,5,90], intLength = 3
<strong>Output:</strong> [101,111,121,131,141,999]
<strong>Explanation:</strong>
The first few palindromes of length 3 are:
101, 111, 121, 131, 141, 151, 161, 171, 181, 191, 202, ...
The 90<sup>th</sup> palindrome of length 3 is 999.
</pre>

<p><strong class="example">Example 2:</strong></p>

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

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= queries.length &lt;= 5 * 10<sup>4</sup></code></li>
	<li><code>1 &lt;= queries[i] &lt;= 10<sup>9</sup></code></li>
	<li><code>1 &lt;= intLength&nbsp;&lt;= 15</code></li>
</ul>

import math
class Solution:
    def kthPalindrome(self, queries: List[int], intLength: int) -> List[int]:
        n = math.ceil(intLength/2)
        num_palin = 9*pow(10,n-1)
        print(num_palin)
        if intLength == 1 or intLength == 2:
            num_palin = 9
            
        print(num_palin)
        res = []
        for i in range(len(queries)):
            if queries[i]>num_palin:
                res.append(-1)
                continue
            start = pow(10,(n-1))
            total = 0
            temp = queries[i]
            div = 100
            start+=temp
            s = str(start-1)
            print(s)
            add = ""
            if intLength%2==0:
                for i in range(len(s)-1,-1,-1):
                    #s = s + s[i]
                    add+=s[i]
            else:
                for i in range(len(s)-2,-1,-1):
                    add+=s[i]
            s = s + add
            print(s)
            res.append(int(s))
        return res


        # while temp>9:
        #     print(temp)
        #     if temp%div!=temp:
        #         start= start+(temp//10)
        #         temp = temp%10
        #         div/=10
        #         print(start)
578