<p>Let&#39;s say a positive integer is a <strong>super-palindrome</strong> if it is a palindrome, and it is also the square of a palindrome.</p>

<p>Given two positive integers <code>left</code> and <code>right</code> represented as strings, return <em>the number of <strong>super-palindromes</strong> integers in the inclusive range</em> <code>[left, right]</code>.</p>

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

<pre>
<strong>Input:</strong> left = &quot;4&quot;, right = &quot;1000&quot;
<strong>Output:</strong> 4
<strong>Explanation</strong>: 4, 9, 121, and 484 are superpalindromes.
Note that 676 is not a superpalindrome: 26 * 26 = 676, but 26 is not a palindrome.
</pre>

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

<pre>
<strong>Input:</strong> left = &quot;1&quot;, right = &quot;2&quot;
<strong>Output:</strong> 1
</pre>

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

<ul>
	<li><code>1 &lt;= left.length, right.length &lt;= 18</code></li>
	<li><code>left</code> and <code>right</code> consist of only digits.</li>
	<li><code>left</code> and <code>right</code> cannot have leading zeros.</li>
	<li><code>left</code> and <code>right</code> represent integers in the range <code>[1, 10<sup>18</sup> - 1]</code>.</li>
	<li><code>left</code> is less than or equal to <code>right</code>.</li>
</ul>

class Solution {
    bool isPalindrome(string s) {
        int l = 0, r = s.length() - 1;
        while (l <= r) {
            if (s[l++] != s[r--])   return false;
        }
        return true;
    }
public:
    int superpalindromesInRange(string left, string right) {
        long long r = stol(right), l = stol(left);
        vector<long long>nums;
        for (long long i=1; i<=9; i++)  nums.push_back(i);
        for (long long i=1; i<=1e4; i++) {
            string s = to_string(i);
            string t = s;
            reverse(t.begin(), t.end());
            nums.push_back(stol(s + t));
            for (int j=0; j<10; j++) {
                nums.push_back(stol(s + to_string(j) + t));
            }
        }
        int count = 0;
        for (auto x: nums) {
            if (x > 1e9)    continue;
            long long sq = x*x;
            if (sq <= r && sq >= l && isPalindrome(to_string(sq)))    count++;
        }
        return count;
    }
};
148600