<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) {
        string longest="";
        int n=s.length();
        int j;

        for(int i=0;i<n;i++){
            j=n-1;

            string subs="";

            string subsrev="";

            while(i<j){

                if(s[i]==s[j] && longest.length()<(j-i+1)){
                    subs= s.substr(i,(j-i+1));
                    subsrev= subs;
                    reverse(subsrev.begin(), subsrev.end());
                    if(subs==subsrev){
                        longest=subs;
                    }
                }
                j--;
                
            }
        }

        if(longest.length()==0){
            longest= s[0];
        }

       

        return longest;

    
    }
};
355659