<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:
        # Can we do it using longest substing method or should we invent another method to do it
        # CONDITIONS:'ba' :- 'ba' is not palindrome.
        ans = s[0]
        leng = len(s)
        dp = []
        for i in range(leng):
            temp = []
            for j in range(leng):
                if i == j:
                    temp.append(True)
                else:
                    temp.append(False)
            dp.append(temp)
        for i in range(leng - 1, -1, -1):
            for j in range(i + 1, leng):
                if s[i] == s[j] and (dp[i+1][j-1] or j == i + 1):
                    dp[i][j] = True
                    if j - i + 1 > len(ans):
                        ans = s[i:j+1]
        # for i in dp:
        #     print(*i)
        return ans

24900