<p>Given a string <code>s</code>, return <em>the longest</em> <span data-keyword="palindromic-string"><em>palindromic</em></span> <span data-keyword="substring-nonempty"><em>substring</em></span> in <code>s</code>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> s = &quot;babad&quot;
<strong>Output:</strong> &quot;bab&quot;
<strong>Explanation:</strong> &quot;aba&quot; is also a valid answer.
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> s = &quot;cbbd&quot;
<strong>Output:</strong> &quot;bb&quot;
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= s.length &lt;= 1000</code></li>
	<li><code>s</code> consist of only digits and English letters.</li>
</ul>

class Solution {
public:
    string longestPalindrome(string s) {

        auto isPalindrome = [](string_view sv) {
            for (size_t i = 0; i < sv.size() / 2; ++i) {
                if (sv[i] != sv[sv.size() - i - 1]) {
                    return false;
                }
            }
            return true;
        };

        vector<string_view> palendromes;
        palendromes.reserve(1000);
        
        for (size_t i = 0; i < s.size(); ++i) {
            for (size_t j = s.size(); j > i; --j) {
                string_view sv{&s[i], &s[j]};
                if (isPalindrome(sv)) {
                    palendromes.push_back(sv);
                }
            }
        }

        return string{*ranges::max_element(palendromes, [](auto &a, auto &b) { return a.size() < b.size(); })};
    }
};
119855