Longest Palindromic Subsequence LeetCode solution in JavaScript

1
var longestPalindromeSubseq = function (s) {
2
  const { length } = s;
3
  const dp = Array(length)
4
    .fill("")
5
    .map(() => Array(length).fill(0));
6

7
  for (let start = 0; start < length; start++) {
8
    const str = s[start];
9
    dp[start][start] = 1;
10

11
    for (let end = start - 1; end >= 0; end--) {
12
      dp[start][end] =
13
        str === s[end]
14
          ? dp[start - 1][end + 1] + 2
15
          : Math.max(dp[start - 1][end], dp[start][end + 1]);
16
    }
17
  }
18
  return dp[length - 1][0];
19
};