You are given a string word. A letter c is called a special character if both its lowercase and uppercase forms appear in word, and every lowercase occurrence of c appears strictly before the first uppercase occurrence of c.

Return the total number of special characters in word.

Constraints:

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

• word consists of only lowercase and uppercase 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.