<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 biggie="";
        
        for(int i=0;i<s.size();i++){
            //case of odd,s[i],middle
            string shortie="";
            shortie+=s[i];
            int j=1;
            while((j+i)<s.size()&&(i-j)>=0){
                if(s[i+j]==s[i-j]){
                    string temp="";
                    temp+=s[i+j];
                    temp+=shortie;
                    shortie=temp;
                    shortie+=s[i-j];
                    j++;
                    }
                    else{
                        break;
                    }
            }
            if(shortie.size()>biggie.size()){
                biggie=shortie;
            }
            shortie="";
             j=1;
            int c=i;
            int d=i-1;
            while((c)<s.size()&&(d)>=0){
                if(s[c]==s[d]){
                    string temp="";
                    temp+=s[c];
                    temp+=shortie;
                    shortie=temp;
                    shortie+=s[d];
                    d--;
                    c++;
                    }
                    else{
                        break;
                    }
            }
            if(shortie.size()>biggie.size()){
                biggie=shortie;
            }
            shortie="";
        }
        return biggie;
    }
};
476584