You are given a circular integer array nums and an integer array queries.

For each query index queries[i], find the minimum circular distance to another index j such that j \neq queries[i] and nums[j] == nums[queries[i]]. If no such index exists, the answer for that query is $-1$.

Return an array containing the answer for each query in queries.

Note: The circular distance between two indices i and j in an array of length n is defined as $\min(|i - j|, n - |i - j|)$.

Constraints:

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

• $1 \leq$ nums[i] $\leq 10^6$

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

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.