<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:
    bool isPalindrome(string s){
        int n = s.size();
        for(int i = 0;i<n/2;i++)
            if(s[i] != s[n-1-i])
                return false;
        return true;
    }
    string longestPalindrome(string s) {
        string ans = "";
        for(int i = 0;i<s.size();i++){
            string str = "";
            for(int j = i;j<s.size();j++){
                str += s[j];
                if(s[j] == s[i]){
                    if(isPalindrome(str) && str.size() > ans.size())
                        ans = str;
                }
            }
            if(ans.size() == s.size())
                break;
        }
        return ans;
    }
};
434260