<p>Given a string <code>s</code>, find <em>the longest palindromic <strong>subsequence</strong>&#39;s length in</em> <code>s</code>.</p>

<p>A <strong>subsequence</strong> is a sequence that can be derived from another sequence by deleting some or no elements without changing the order of the remaining elements.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> s = &quot;bbbab&quot;
<strong>Output:</strong> 4
<strong>Explanation:</strong> One possible longest palindromic subsequence is &quot;bbbb&quot;.
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> s = &quot;cbbd&quot;
<strong>Output:</strong> 2
<strong>Explanation:</strong> One possible longest palindromic subsequence is &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> consists only of lowercase English letters.</li>
</ul>

class Solution:
    def longestPalindromeSubseq(self, s: str) -> int:
        n = len(s)
        dp = [[""]*n for _ in range(n)]
        for i in range(n-1,-1,-1):
            for j in range(i,n):
                if i>j: continue
                elif i==j: dp[i][j] = s[i]
                else:
                    if s[i] == s[j]:
                        dp[i][j] = s[i]+dp[i+1][j-1]+s[i]
                    else:
                        if len(dp[i+1][j])>len(dp[i][j-1]):
                            dp[i][j] = dp[i+1][j]
                        else: 
                            dp[i][j] = dp[i][j-1]
        print(dp[0][n-1])
        return len(dp[0][n-1])

206793