You are given a string word and an integer k.

A substring of word is considered complete if it satisfies both of the following conditions:

• Every distinct character present in the substring appears exactly k times within that substring.

• The absolute difference between the alphabet positions of any two adjacent characters in the substring is at most $2$.

Return the total number of complete substrings of word.

Constraints:

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

• word consists only of lowercase English letters.

• $1 \leq$ k $\leq$ word.length

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.