A positive integer is considered a superpalindrome if it is a palindrome and is also the square of a palindrome.

Given two strings left and right representing positive integers, return the count of superpalindromes in the inclusive range $[$left, right$]$.

Constraints:

• $1 \leq$ left.length, right.length $\leq 18$

• left and right consist of only digits.

• left and right cannot have leading zeros.

• left and right represent integers in the range $[1, 10^{18} - 1]$.

• left is less than or equal to right.

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.