Find Palindrome With Fixed Length LeetCode solution in Python

1
class Solution:
2
    def kthPalindrome(self, queries: List[int], intLength: int) -> List[int]:
3
        ogLength = intLength
4
        isOdd = intLength & 1
5
        if isOdd:
6
            intLength += 1
7
        k = intLength // 2
8
        k = 10 ** (k - 1)
9
        op = []
10
        for q in queries:
11
            pal = str(k + q - 1)
12
            if isOdd:
13
                pal += pal[::-1][1:]
14
            else:
15
                pal += pal[::-1]
16
            if len(pal) == ogLength:
17
                op.append(int(pal))
18
            else:
19
                op.append(-1)
20
        return op