<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:
  int superpalindromesInRange(string left, string right) {
    auto create_seed_palindromes = []() {
      vector<int64_t> res = {1, 2, 3, 4, 5, 6, 7, 8, 9};
      for (int left_right = 1; left_right <= 9999; ++left_right) {
        const string s = to_string(left_right), r_s{s.rbegin(), s.rend()};
        res.push_back(stoll(s + r_s));
        for (int mid = 0; mid <= 9; ++mid) {
          res.push_back(stoll(s + to_string(mid) + r_s));
        }
      }
      std::ranges::sort(res);
      return res;
    };

    auto is_palindrome = [](const string& s) {
      return s == string{s.rbegin(), s.rend()};
    };

    const int64_t l = stoll(left), r = stoll(right);
    int res = 0;
    for (int64_t p : create_seed_palindromes()) {
      const int64_t p_2 = p * p;
      if (p_2 > r) {
        break;
      }

      res += (l <= p_2) && is_palindrome(to_string(p_2));
    }
    return res;
  }
};
187200