You are given an integer n, an integer array nums of length n, an integer maxDiff, and a $2$D integer array queries.

An undirected graph with n nodes labeled from $0$ to n - 1 is constructed such that an edge exists between node i and node j if and only if $|$ nums[i] $-$ nums[j] $| \leq$ maxDiff.

For each query queries[i] $=$ [u_i, v_i], determine the minimum distance (the minimum number of edges on a path) between node u_i and node v_i. If there is no path between the two nodes, the answer for that query is $-1$.

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

Constraints:

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

• $0 \leq$ nums[i] $\leq 10^5$

• $0 \leq$ maxDiff $\leq 10^5$

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

• queries[i] $==$ [u_i, v_i]

• $0 \leq$ u_i, v_i $< n$

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.