You are given an integer array nums.

An integer is considered special if:

• It appears in nums exactly $3$ times.

• The indices $i_1 < i_2 < i_3$ of its three occurrences are equally spaced, such that $i_2 - i_1 = i_3 - i_2$.

Return the number of special integers present in nums.

Constraints:

• $3 \leq$ nums.length $\leq 100$

• $1 \leq$ nums[i] $\leq 100$

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.