<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) {
        int maxLength = 0;
        string ans = "";
        for (int ptr = 0; ptr<s.size(); ptr++) {
            
            string reverse_str = ""; 
            string check = "";

            for (int i = ptr; i < s.size(); i++) {
                char ch = s[i];
                reverse_str.insert(reverse_str.begin(), ch);
                check.push_back(ch);
                if (maxLength < check.size() && check == reverse_str) {
                    maxLength = check.size();
                    ans = check;
                }
                
            }
        }
            return ans ;
    }
};
246826