Longest Palindromic Subsequence?

int LongestPalindromeSubseq(string s) {

int n = s.Length;

int[,] dp = new int[n, n];

for (int i = n - 1; i >= 0; i--) {

dp[i, i] = 1;

for (int j = i + 1; j < n; j++) {

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

Follow on:

dp[i, j] = dp[i + 1, j - 1] + 2;

else

dp[i, j] = Math.Max(dp[i + 1, j], dp[i, j - 1]);

return dp[0, n - 1];