<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:
    bool isPalindrome(string s)
{
    for (int i = 0; i < s.length(); i++)
    {
        if(s.at(i) != s.at(s.length() - i - 1))
        {
            return false;
        }
    }
    return true;
}
    string longestPalindrome(string s) {
        int left, right;
    int longestStartIndex = 0, longestLength = 0;

    for (left = 0; left < s.length() - longestLength; left++)
    {
        for (right = s.length() - 1; right >= left; right--)
        {
            if(s.at(right) == s.at(left))
            {
                if(isPalindrome(s.substr(left, right - left + 1)))
                {
                    if(right - left + 1 > longestLength)
                    {
                        longestStartIndex = left;
                        longestLength = right - left + 1;
                        break;
                    }
                }
            }
        }
    }

    return s.substr(longestStartIndex, longestLength);
    }
};
404029