You are given a string word.

Two characters are considered almost equal if they are the same or adjacent in the alphabet. For instance, 'a' and 'b' are almost equal, and 'a' and 'a' are almost equal.

In one operation, you can change any character in word to any lowercase English letter.

Return the minimum number of operations required so that word contains no adjacent almost equal characters.

Constraints:

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

• word consists only 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.