<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:
        res = ""
        reslen = 0
        for i in range(len(s)):
            l,r = i,i
            while l>=0 and r<len(s) and s[l] == s[r]:
                if r-l+1>reslen:
                    reslen = r-l+1
                    res = s[l:r+1]
                l-=1
                r+=1
            l,r = i,i+1
            while l>=0 and r<len(s) and s[l] == s[r]:
                if r-l+1>reslen:
                    reslen = r-l+1
                    res = s[l:r+1]
                l-=1
                r+=1
        return res
            













        res = ""
        reslen = 0
        for i in range(len(s)):
            l,r= i,i
            while l>=0 and r<len(s) and s[l] == s[r]:
                if r-l+1>reslen:
                    reslen = r-l+1
                    res = s[l:r+1]
                l-=1
                r+=1
            l,r= i,i+1
            while l>=0 and r<len(s) and s[l] == s[r]:
                if r-l+1>reslen:
                    reslen = r-l+1
                    res = s[l:r+1]
                l-=1
                r+=1
        return res
            












        res = ""
        reslen = 0
        for i in range(len(s)):
            l,r = i,i
            while l>=0 and r<len(s) and s[l] == s[r]:
                if reslen<r-l+1:
                    reslen = r-l+1
                    res = s[l:r+1]
                l = l-1
                r=  r+1
            l,r = i,i+1
            while l>=0 and r<len(s) and s[l] == s[r]:
                if reslen<r-l+1:
                    reslen = r-l+1
                    res = s[l:r+1]
                l = l-1
                r=  r+1
        return res
            












        res = ""
        reslen = 0
        for i in range(len(s)):
            l,r = i,i
            while l>=0 and r<len(s) and s[l] == s[r]:
                if reslen<r-l+1:
                    reslen = r-l+1
                    res = s[l:r+1]
                l-=1
                r+=1
            l,r = i,i+1
            while l>=0 and r<len(s) and s[l] == s[r]:
                if reslen<r-l+1:
                    reslen = r-l+1
                    res = s[l:r+1]
                l-=1
                r+=1
        return res
            
















        res = ""
        reslen = 0
        
        for i in range(len(s)):
            l,r = i,i
            while l>=0 and r<len(s) and s[l] == s[r]:
                if r-l+1>reslen:
                    reslen = r-l+1
                    res = s[l:r+1]
                l-=1
                r+=1
            l,r = i,i+1
            while l>=0 and r<len(s) and s[l] == s[r]:
                if r-l+1>reslen:
                    reslen = r-l+1
                    res = s[l:r+1]
                l-=1
                r+=1
        return res
            



















        res = ""
        reslen = 0
        for i in range(len(s)):
            l,r = i,i
            while l>=0 and r<len(s) and s[l] == s[r]:
                if r-l+1>reslen:
                    reslen = r-l+1
                    res = s[l:r+1]
                r+=1
                l-=1
            l,r = i,i+1
            while l>=0 and r<len(s) and s[l] == s[r]:
                if r-l+1>reslen:
                    reslen = r-l+1
                    res = s[l:r+1]
                r+=1
                l-=1
        return res
            






















        res = ""
        reslen =  0 
        for i in range(len(s)):
            l,r = i,i
            while l>=0 and r<len(s) and s[l]==s[r]:
                if r-l+1>reslen:
                    reslen = r-l+1
                    res = s[l:r+1]
                r+=1
                l-=1
            l,r = i,i+1
            while l>=0 and r<len(s) and s[l]==s[r]:
                if r-l+1>reslen:
                    reslen = r-l+1
                    res = s[l:r+1]
                r+=1
                l-=1
        return res
            



















        res = ""
        reslen = 0
    
        for i in range(len(s)):
            l,r = i,i
            while l>=0 and r<len(s) and s[l] == s[r]:
                if r-l+1>reslen:
                    reslen = r-l+1
                    res = s[l:r+1]
                r+=1
                l-=1
            l,r = i,i+1
            while l>=0 and r<len(s) and s[l] == s[r]:
                if r-l+1>reslen:
                    reslen = r-l+1
                    res = s[l:r+1]
                r+=1
                l-=1
        return res
            

















        res = ""
        reslen = 0
        for i in range(len(s)):
            l,r = i,i
            while l>=0 and r<len(s) and s[l]==s[r]:
                if r-l+1>reslen:
                    reslen = r-l+1
                    res = s[l:r+1]
                r+=1
                l-=1
            l,r = i,i+1
            while l>=0 and r<len(s) and s[l]==s[r]:
                if r-l+1>reslen:
                    reslen = r-l+1
                    res = s[l:r+1]
                r+=1
                l-=1
        return res
























        res = ""
        reslen =0
        for i in range(len(s)):
            l,r = i,i
            while l>=0 and r<len(s) and s[l] == s[r]:
                if r-l+1>reslen:
                    res = s[l:r+1]
                    reslen = r-l+1 
                l-=1
                r+=1
            l,r = i,i+1
            while l>=0 and r<len(s) and s[l] == s[r]:
                if r-l+1>reslen:
                    res = s[l:r+1]
                    reslen = r-l+1 
                l-=1
                r+=1
        return res
        
            























        res = ""
        reslen = 0
        
        for i in range(len(s)):
            l,r = i,i
            while l>=0 and r<len(s) and s[l]==s[r]:
                if r-l+1>reslen:
                    reslen = r-l+1
                    res=s[l:r+1]
                l-=1
                r+=1
            l,r = i,i+1
            while l>=0 and r<len(s) and s[l]==s[r]:
                if r-l+1>reslen:
                    reslen = r-l+1
                    res=s[l:r+1]
                l-=1
                r+=1
        return res
            






















        res = ""
        reslen = 0
        for i in range(len(s)):
            l,r = i,i
            while l>=0 and r<len(s) and s[l]==s[r]:
                if r-l+1>reslen:
                    reslen = max(r-l+1,reslen)
                    res = s[l:r+1]
                r+=1
                l-=1
            l,r = i,i+1
            while l>=0 and r<len(s) and s[l]==s[r]:
                if r-l+1>reslen:
                    reslen = max(r-l+1,reslen)
                    res = s[l:r+1]
                r+=1
                l-=1
        return res
            

































        res = ""
        reslen = 0 
        
        for i in range(len(s)):
            r,l = i,i
            while l>=0 and r<len(s) and s[l] == s[r]:
                if reslen<r-l+1:
                    res = s[l:r+1]
                    reslen=r-l+1
                l-=1
                r+=1
            r,l = i+1,i
            while l>=0 and r<len(s) and s[l] == s[r]:
                if reslen<r-l+1:
                    res = s[l:r+1]
                    reslen=r-l+1
                l-=1
                r+=1
        return res
            





























        res = ""
        reslen = 0

        for i in range(len(s)):
            l,r = i,i
            while l>=0 and r<len(s) and s[l] == s[r]:
                if reslen<r-l+1:
                    reslen = r-l+1
                    res = s[l:r+1]
                l-=1
                r+=1
            l,r = i,i+1
            while l>=0 and r<len(s) and s[l] == s[r]:
                if reslen<r-l+1:
                    reslen = r-l+1
                    res = s[l:r+1]
                l-=1
                r+=1
        return res



















        res = ""
        reslen=0
        for i in range(len(s)):
            l,r = i,i
            while l>=0 and r<len(s) and s[l] == s[r]:
                if r-l+1>reslen :
                    reslen = r-l+1
                    res = s[l:r+1]
                r+=1
                l-=1
            l,r = i,i+1
            while l>=0 and r<len(s) and s[l] == s[r]:
                if r-l+1>reslen :
                    reslen = r-l+1
                    res = s[l:r+1]
                r+=1
                l-=1
        return res
            


































        res = ""
        reslen = 0
        for i in range(len(s)):
            r,l = i,i
            while l>=0 and r<len(s) and s[l]==s[r]:
                if reslen<r-l+1:
                    res = s[l:r+1]
                    reslen = r-l+1
                r+=1
                l-=1
            r,l = i+1,i
            while l>=0 and r<len(s) and s[l]==s[r]:
                if reslen<r-l+1:
                    res = s[l:r+1]
                    reslen = r-l+1
                r+=1
                l-=1
        return res
            

































        res = ""
        reslen = 0
        for i in range(len(s)):
            #odd len
            l,r = i,i
            while l>=0 and r<len(s) and s[l] == s[r]:
                if reslen<r-l+1:
                    res = s[l:r+1]
                    reslen = r-l+1
                l-=1
                r+=1
            #even len
            l,r = i,i+1
            while l>=0 and r<len(s) and s[l] == s[r]:
                if reslen<r-l+1:
                    res = s[l:r+1]
                    reslen = r-l+1
                l-=1
                r+=1
        return res











































        res = ""
        reslen = 0
        for i in range(len(s)):
            l,r=i,i
            while l>=0 and r<len(s) and s[l] == s[r]:
                if reslen < r-l+1:
                    reslen = r-l+1
                    res = s[l:r+1]
                l-=1
                r+=1

            l,r=i,i+1
            while l>=0 and r<len(s) and s[l] == s[r]:
                if reslen < r-l+1:
                    reslen = r-l+1
                    res = s[l:r+1]
                l-=1
                r+=1
        return res
            
                



        
        
        
        
        
        
        
        
        
        
        
        
        
        
        
        
        
        
        
        res = ""
        reslen = 0
        for i in range(len(s)):
            r,l = i,i
            while l>=0 and r<len(s) and s[l] == s[r]:
                if r-l+1>reslen:
                    res = s[l:r+1]
                    reslen = r-l+1
                r+=1
                l-=1
            
            r,l = i+1,i
            while l>=0 and r<len(s) and s[l] == s[r]:
                if r-l+1>reslen:
                    res = s[l:r+1]
                    reslen = r-l+1
                r+=1
                l-=1
        return res
            


        
        
        
        
        
        
        
        
        
        
        
        
        res = ""
        reslen = 0
        for i in range(len(s)):
            #odd
            l,r = i,i
            while l>=0 and r<len(s) and s[l] == s[r]:
                if r-l+1>reslen:
                    res = s[l:r+1]
                    reslen = r-l+1
                l-=1
                r+=1
            #even
            l,r = i,i+1
            while l>=0 and r<len(s) and s[l] == s[r]:
                if r-l+1>reslen:
                    res = s[l:r+1]
                    reslen = r-l+1
                l-=1
                r+=1
        return res
            
        
        
        
        
        
        
        
        
        
        
        
        
        
        
        
        
        
        
        
        
        
        
        
        
        
        
        
        
        
        
        
        
        res = ""
        reslen = 0
        
        for  i in range(len(s)):
            l,r = i,i
            while l>=0  and  r<len(s) and s[l]==s[r]:
                if r-l+1 > reslen:
                    res = s[l:r+1]
                    reslen = r-l+1
                l-=1
                r+=1
           
            l,r = i,i+1
            while l>=0  and  r<len(s) and s[l]==s[r]:
                if r-l+1 > reslen:
                    res = s[l:r+1]
                    reslen = r-l+1
                l-=1
                r+=1
        return res
            
            
        
17600