<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 {
public:
    
    bool isPalindrome(long long num) {
        long long original = num, reversed = 0;
        while (num > 0) {
            reversed = reversed * 10 + num % 10;
            num /= 10;
        }
        return original == reversed;
    }


    vector<long long> generatedPalindrome() {
        vector<long long> res;

        for (int i = 1; i <= 9; ++i) {
            res.push_back(i);
        }
        for (int i = 1; i <= 9999; i++) {
            string s = to_string(i);
            string rev = s;
            reverse(rev.begin(), rev.end());

            res.push_back(stoll(s+rev));

            for (char c = '0'; c <= '9'; c++ ){
                res.push_back(stoll(s+c+rev));
            }
        }
        sort(res.begin(), res.end());

        return res;
    }

    int superpalindromesInRange(string left, string right) {
        int count = 0;
        long long l = stoll(left), r = stoll(right);
        vector<long long> palindromes = generatedPalindrome();
        for (long long p : palindromes ) {
            long long pSquared = p * p;
            if ( pSquared > r) break;
            if ( pSquared >= l && isPalindrome(pSquared)) count++;
        }
        return count;
    }
};
119200