You are given an integer array nums and a $2 ext{D}$ integer array queries, where each queries[i] is of the form $[l_i, r_i]$.

For each query, consider the subarray nums[$l_i \dots r_i$]. The minimum absolute difference of this subarray is defined as the minimum absolute difference between any two elements in the subarray that have different values. If all elements in the subarray are identical, the minimum absolute difference is defined as $-1$.

Return an array containing the answers to all queries in the given order.

Constraints:

• $2 \leq$ nums.length $\leq 10^5$

• $1 \leq$ nums[i] $\leq 100$

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

• $0 \leq l_i < r_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.