You are given an integer limit and a $2 ext{D}$ array queries of size n where queries[i] $= [x, y]$.

There are limit $+ 1$ balls labeled from $0$ to limit. Initially, all balls are uncolored. For each query, ball $x$ is assigned the color $y$. If ball $x$ is already colored, its color is replaced with the new color $y$.

Return an array of length n where the value at index $i$ is the number of distinct colors present among all balls after processing the query at index $i$.

Constraints:

• $1 \leq$ limit $\leq 10^9$

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

• queries[i].length $== 2$

• $0 \leq$ queries[i][0] $\leq$ limit

• $1 \leq$ queries[i][1] $\leq 10^9$

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.