<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 isPal(string s) {
        int left = 0;
        int right = s.size() - 1;
        
        while (left < right) {
            if (s[left] != s[right]) {
                return false;
            }
            left++;
            right--;
        }
        
        return true;
    }

    int superpalindromesInRange(string l, string r) {
        int cnt = 0;
        long long left = stoll(l);
        long long right = stoll(r);
        auto checkAndCount = [&](long long num) {
            if (num > 0 && right / num < num) return;
            long long square = num * num;
            if (square >= left && square <= right && isPal(to_string(square))) {
                cnt++;
            }
        };

        //odd
        for (int i = 1; i < 100000; ++i) {  
            string s = to_string(i);
            string rev(s.rbegin(), s.rend());
            long long pal = stoll(s + rev.substr(1)); 
            checkAndCount(pal);
        }

        //even
        for (int i = 1; i < 100000; ++i) {
            string s = to_string(i);
            string rev(s.rbegin(), s.rend());
            long long pal = stoll(s + rev);  
            checkAndCount(pal);
        }

        return cnt;
    }
};

41800