You are given a string s consisting of lowercase English letters.

In one operation, you can select any character present in s and replace all occurrences of that character with the next letter in the alphabet, where 'z' wraps around to 'a'.

Return the minimum number of operations required to make every character in s equal to 'a'.

Constraints:

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

• s 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.