<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 {
public:
    int longestCommonSubsequence(string text1, string text2) {

        int n=text1.size(),m=text2.size();
        vector<int> prev(m+1,0);
        

        for(int idx1=1;idx1<=n;idx1++){
            vector<int> curr(m+1,0);
            for(int idx2=1;idx2<=m;idx2++){
                  if(text1[idx1-1]==text2[idx2-1])
                  curr[idx2]=1+prev[idx2-1];
                  else curr[idx2]=max(prev[idx2],curr[idx2-1]);
                
            }
            prev = curr;
        }
        return prev[m];
        
    }
    int longestPalindromeSubseq(string s) {
        string t=s;
        reverse(t.begin(),t.end());
        return longestCommonSubsequence(s,t);
        
    }
};
73900