<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 {
private:
 bool ispalindrome(string s){
    int i=0,j=s.length()-1;
    while(i<j){
        if(s[i]!=s[j])
         return false;
        i++,j--;
    }
    return true;
 }
public:
    string longestPalindrome(string s) {
        if(s.length()==1) return s;
        string substring1;
        string substring2;
        int len=INT_MIN;
        int n=s.length();
        for(int i=0;i<n;i++){
            for(int j=i;j<n;j++){
                if((s[i]==s[j]) && (j-i+1)>len){
                    if(ispalindrome(s.substr(i,j-i+1))){
                        len=j-i+1;
                        substring2=s.substr(i,j-i+1);
                    }
                }
            }
        }
        return substring2;
    } 
};
349613