class Solution {

public:

    int longestPalindromeSubseq(string s) {

        int dp[][] = {};

        int res = ;

        for (int i = s.length()-;i >=;i--){

            for (int j = i+;j<s.length();j++){

                dp[i][i] = ;

                if (s[i] == s[j]){

                    dp[i][j] = dp[i][j] > dp[i+][j-]+ ? dp[i][j] :dp[i+][j-]+;

                }

                else{

                    dp[i][j] = dp[i][j-] > dp[i+][j] ? dp[i][j-] : dp[i+][j];

                }

                res = res > dp[i][j] ? res : dp[i][j];

            }

        }

        return res;

    }

};