Status: IN
After sorting, the minimum max-min difference over all size-k subsets equals the minimum `nums[i+k-1] - nums[i]`, because optimal subsets are always contiguous in sorted order.
Source: entries/2026/06/06/minimum-difference-between-highest-and-lowest-of-k-scores-solution.md