Leetcode Problem 2370. Longest Ideal Subsequence

Algorithm

1. Initialize an array dp of size 128 (to cover all lowercase letters) with all elements set to 0.
2. Initialize a variable res to store the maximum length of the ideal subsequence found so far.
3. Iterate through each character c in the string s: a. Convert c to its ASCII value i. b. For each ASCII value j in the range [i - k, i + k] (ensuring j is within the bounds of the dp array): i. Update dp[i] to be the maximum of dp[i] and dp[j]. c. Increment dp[i] by 1 to include the current character c in the subsequence. d. Update res to be the maximum of res and dp[i].
4. After the loop, return res as the length of the longest ideal string.