Leetcode 3281. Maximize Score of Numbers in Ranges

Given n intervals [start[i], start[i]+d], pick one integer from each interval to maximize the minimum pairwise absolute difference among the chosen numbers. This is a maximize-minimization problem typically solved by sorting the intervals and using a greedy feasibility check inside a binary search over the candidate minimum distance.