You are given an integer n representing an array of length n where all elements are initially set to $0$, denoting that they are uncolored.

You are also given a $2$D integer array queries, where queries[i] = [index_i, color_i].

For each query:

• Assign color_i to the element at index index_i.

• Count the total number of adjacent pairs with identical non zero colors.

Return an array answer of the same length as queries, where answer[i] is the count of adjacent equal non zero colored elements after processing the query at index i.

Constraints:

• $1 \leq$ n $\leq 10^5$

• $1 \leq$ queries.length $\leq 10^5$

• queries[i].length $= 2$

• $0 \leq$ index_i $\leq$ n $- 1$

• $1 \leq$ color_i $\leq 10^5$

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.