<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 ans="";
        ans+=s[0];
        int maxi=1;

        for(int i =1 ; i<s.size()-1 ; i++){
            // checking for odd
            int start = i-1;
            int end=i+1;
            string right="";
            string left="";
            while(start>=0 && end<s.size() && s[start]==s[end]){
                right+=s[end];
                left=s[start]+left;
                start--;
                end++;
            }
            if((end-start-1)>maxi) {
                ans=left+s[i]+right;
                maxi=ans.size();
            }
            // checking for right
            if(s[i+1]==s[i]){
            int start=i-1;
            int end=i+2;
            string temp="";
            temp+=s[i];
            temp+=s[i+1];
            string right="";
            string left="";
            
            while(start>=0 && end<s.size() && s[start]==s[end]){
                right+=s[end];
                left=s[start]+left;
                start--;
                end++;
            }
            if((end-start-1)>maxi) {
                ans=left+temp+right;
                maxi=ans.size();
            }

            }
            
                
        }
        if(s[0]==s[1]){
                string temp="";
                temp+=s[0];
                temp+=s[1];
                if(temp.size()>maxi){
                    maxi=temp.size();
                    ans=temp;
                }
            
            }
        return ans;


    }
};
440306