{"id":"sort-then-slide-correctness","text":"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.","truth_value":"IN","source":"entries/2026/06/06/minimum-difference-between-highest-and-lowest-of-k-scores-solution.md","source_url":"","source_hash":"","justifications":[],"dependents":[],"metadata":{},"created_at":"","updated_at":"","reviewed_at":"","verified_at":"","retracted_at":"","explanation":{"steps":[{"node":"sort-then-slide-correctness","truth_value":"IN","reason":"premise"}]}}