Solution

Method 1 - Union-Find (Disjoint Set Union)

Intuition

Since nums is sorted, nodes with consecutive indices are connected if their values differ by at most maxDiff. Thus, the graph consists of connected components formed by joining consecutive nodes where the difference is within maxDiff. We can use Union-Find to efficiently group nodes into components, then answer each query by checking if ui and vi are in the same component.

Approach

Initialize Union-Find for all nodes.
For each

Related Tags