3534. Path Existence Queries in a Graph II

Given a graph of n vertices (0..n-1) and an array nums. There's an undirected edge between i and j if |nums[i] - nums[j]| ≤ maxDiff. For each query [u, v], find the minimum number of edges in a…