For any value of queries[i] and intLength, how can you check if there exists at least queries[i] palindromes of length intLength?

Since a palindrome reads the same forwards and backwards, consider how you can efficiently find the first half (ceil(intLength/2) digits) of the palindrome.