<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>

#define ll long long
class Solution {
public:
    int superpalindromesInRange(string left, string right) {
        ll l = stoll(left);
        ll r = stoll(right);
        int ans = 0;

        // Even length palindromes
        for (ll i = 1; i < 10000; ++i) {
            ll pal = createPalindrome(i, true);
            ll spal = pal * pal;
            if (spal > r) break;
            if (spal >= l && isPalindrome(spal)) {
                ans++;
            }
        }

        // Odd length palindromes
        for (ll i = 1; i < 100000; ++i) {
            ll pal = createPalindrome(i, false);
            ll spal = pal * pal;
            if (spal > r) break;
            if (spal >= l && isPalindrome(spal)) {
                ans++;
            }
        }

        return ans;
    }

private:
    ll createPalindrome(ll num, bool even) {
        ll pal = num;
        if (!even) num /= 10;
        while (num > 0) {
            pal = pal * 10 + (num % 10);
            num /= 10;
        }
        return pal;
    }

    bool isPalindrome(ll n) {
        return n == reverse(n);
    }

    ll reverse(ll n) {
        ll rev = 0;
        while (n > 0) {
            rev = rev * 10 + (n % 10);
            n /= 10;
        }
        return rev;
    }
};

7500