#2370. Longest Ideal Subsequence

var longestIdealString = function(s, k) {
    let dp = new Array(27).fill(0);

    for (let i = 0; i < s.length; i++) {
        let diff = s[i].charCodeAt(0) - 'a'.charCodeAt(0);
        let maxi = Number.MIN_SAFE_INTEGER;

        let left = Math.max(diff - k, 0);
        let right = Math.min(diff + k, 26);

        for (let j = left; j <= right; j++) {
            maxi = Math.max(maxi, dp[j]);
        }

        dp[diff] = maxi + 1;
    }

    let max = Number.MIN_SAFE_INTEGER;
    for (let i = 0; i < 27; i++) {
        if (dp[i] > max)
            max = dp[i];
    }

    return max;
};