<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:
        # perhaps the easiest way is to create a dictionary for each new start term
        string_indexes=range(len(s))
        palindrome=s[0]
        for start_index in string_indexes:
            for end_index in string_indexes[start_index+1:]:
                # print([start_index,end_index])
                if end_index-start_index+1<=len(palindrome):
                    continue
                possible_palindrome=s[start_index:end_index+1]
                if possible_palindrome==possible_palindrome[::-1]:
                    palindrome=possible_palindrome
        return palindrome
        
16300