You are given an array of integers colors, where each element represents a color, and a $2 ext{D}$ array queries where each query is in the form [i, c].

For each query [i, c], find the shortest distance between index i and any index $j$ such that colors[j] == c. The distance between index i and index $j$ is given by $|i - j|$. If the color c does not exist in colors, the answer for that query is $-1$.

Return an array of integers representing the answers to all queries in the given order.

Constraints:

• $1 \leq$ colors.length $\leq 5 imes 10^4$

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

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

• queries[i].length $= 2$

• $0 \leq$ queries[i][0] $<$ colors.length

• $1 \leq$ queries[i][1] $\leq 3$

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.