<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:
    int maxi=0;
    string ans;
    void palin(string s, int i, int j)
    {

        while(i>=0 && j<s.length())
        {
            if(s[i]!=s[j])
            {
                if(j-i-1>maxi)
                {
                    maxi=j-i-1;
                    ans.clear();
                    for(int k=i+1;k<j;k++)
                        ans.push_back(s[k]);
                }
                break;
            }
            i--;
            j++;
        }
        if(s[i+1]==s[j-1])
        {
            if(j-i-1>maxi)
            {
                maxi=j-i-1;
                ans.clear();
                for(int k=i+1;k<j;k++)
                    ans.push_back(s[k]);
            }
        }
    }
    string longestPalindrome(string s) {
        int i=0;
        int j=0;
        for(int i=0;i<s.length();i++)
        {
            palin(s,i,i);
            palin(s,i,i+1);
        }
        return ans;
    }
};
168225