<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:
    def longestPalindrome(self, s: str) -> str:
        
        longestLen = -1
        longestLeft = longestRight = -1
        for indx in range(len(s)):
            left = right = indx
            while True:
                if left < 0 or right >= len(s):
                    break

                if s[left] != s[right]:
                    break
                
                left = left-1
                right = right+1

            if right - left + 1 > longestLen:
                longestLen = right - left + 1
                longestLeft = left + 1
                longestRight = right - 1

            left = indx
            right = indx + 1
            while True:
                if left < 0 or right >= len(s):
                    break

                if s[left] != s[right]:
                    break
                
                left = left-1
                right = right+1

            if right - left + 1 > longestLen:
                longestLen = right - left + 1
                longestLeft = left + 1
                longestRight = right - 1

        print(longestLeft, longestRight)
        return s[longestLeft:longestRight+1]
16800