Find Palindrome With Fixed Length

For each query k, return the k-th smallest positive palindrome with exactly intLength digits (no leading zeros), or -1 if fewer than k palindromes exist. This is solved by enumerating the valid first half (starting from 10^{half-1}) and mirroring it—adjusting for odd/even lengths—and checking if k exceeds the total count.