<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 ispalin(string s)
    {
        string rev = s;
        reverse(rev.begin(), rev.end());
        return rev == s;
    }
    int superpalindromesInRange(string left, string right) {
        long long l = stoll(left);
        long long r = stoll(right);
        vector<long long>v;
        
        for(int i = 1; i < 10; i++)
            v.push_back(i);
        
        for(int i = 1; i <= 1e4; i++)
        {
            string s1 = to_string(i);
            string s2 = to_string(i);
            reverse(s2.begin(), s2.end());
			//Even length palindrome
            v.push_back(stoll(s1+s2));
            //Odd length palindrome
            for(int j = 0; j < 10; j++)
            {
                string temp;
                temp = s1 + to_string(j) + s2;
                v.push_back(stoll(temp));
            }
        }
        int ans = 0;
        for(auto it:v)
        {
            if(it > 1e9)
                continue;
            long long num = it*it;
            if(num <= r and num >= l and ispalin(to_string(num)))
                ans++;
        }
        return ans;
    }
};
        
178400