Leetcode 3194. Minimum Average of Smallest and Largest Elements

Given an even-length integer array, repeatedly pair the smallest and largest elements, compute their averages, and return the smallest such average — equivalently, sort the array and take the minimum of (nums[i] + nums[n-1-i]) / 2 across all i.