You are given a circular array of binary integers colors. An alternating group is defined as a contiguous subarray of $3$ elements where adjacent elements alternate in value (that is, the middle element differs from both its left and right neighbors).

Because colors is circular, the first and last elements are considered adjacent.

Return the total number of alternating groups of size $3$.

Constraints:

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

• $0 \leq$ colors[i] $\leq 1$

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.