<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 solve(string &text1, string &text2,int i,int j,vector<vector<int>>&dp){
        if(i<0||j<0)return 0;
        if(dp[i][j]!=-1)return dp[i][j];
        int ans=0;
        int pick=0;
        if(text1[i]==text2[j]){
          pick=1+solve(text1,text2,i-1,j-1,dp);

          }
         int nopick=max(solve(text1,text2,i-1,j,dp),solve(text1,text2,i,j-1,dp));
         ans=max(pick,nopick);
         return dp[i][j]=ans;
    }
    
    int longestCommonSubsequence(string text1, string text2) {
        int n=text1.size();
        int m=text2.size();
        if(text1==text2){
            return n;
        }
        vector<vector<int>>dp(n,vector<int>(m,-1));
        int ans=solve(text1,text2,n-1,m-1,dp);
        return ans;
       
    }
    int longestPalindromeSubseq(string s) {
        string r=s;
        reverse(s.begin(),s.end());
        return longestCommonSubsequence(r,s);
        
    }
};
35100