<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) {
        if(s.length()<2){
            return s;
        }
        int maxlen =0;
        string result ="" ;
         int n = s.length();
        
        for(int i=0;i<n;i++){
            int left =i;
            int right =i;
            while(left>=0 && right<n &&(s[left]==s[right])){
                if(right-left+1>maxlen){
                  result = s.substr(left,right-left+1);
                  maxlen=right-left+1;
                }
                left--;
                right++;
            }
         }
         
         for(int i=0;i<n;i++){
            int left =i;
            int right =i+1;
            while(left>=0 && right<n &&(s[left]==s[right])){
                if(right-left+1>maxlen){
                  result = s.substr(left,right-left+1);
                  maxlen=right-left+1;
                }
                left--;
                right++;
            }
         }
         
         return result ;
    }

};
23115