You are given a string s consisting of lowercase English letters and an integer k.

A string t is defined as an ideal string if it satisfies the following conditions:

• t is a subsequence of s.

• The absolute difference in the alphabetical positions of every two adjacent characters in t is less than or equal to k.

Return the length of the longest ideal string.

Note: A subsequence is a string derived from another string by deleting some or no characters without changing the relative order of the remaining characters.

Constraints:

• $1 \leq$ s.length $\leq 10^5$

• $0 \leq$ k $\leq 25$

• s consists of lowercase English letters.

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.