Leetcode 2616. Minimize the Maximum Difference of Pairs

Given an array nums and integer p, choose p disjoint index pairs to minimize the maximum absolute difference among the pairs. Typical solution pattern: sort the array and use binary search on the allowed max-difference with a greedy scan to check if p pairs can be formed (n up to 1e5, p ≤ n/2).