Longest Ideal Subsequence LeetCode solution in JavaScript

1
var longestIdealString = function (s, k) {
2
  let n = s.length;
3
  let dp = Array(26).fill(0);
4
  let ans = 0;
5
  for (let i = 0; i < n; i++) {
6
    const cur = s.charCodeAt(i) - 97;
7
    dp[cur] += 1;
8
    for (let j = Math.max(0, cur - k); j <= Math.min(cur + k, 25); j++) {
9
      if (j !== cur) {
10
        dp[cur] = Math.max(dp[cur], dp[j] + 1);
11
      }
12
    }
13
    ans = Math.max(dp[cur], ans);
14
  }
15
  return ans;
16
};