number-of-distinct-averages.cpp

// Time:  O(nlogn)
// Space: O(n)

// sort, two pointers, hash table
class Solution {
public:
    int distinctAverages(vector<int>& nums) {
        sort(begin(nums), end(nums));
        unordered_set<int> lookup;
        for (int left = 0, right = size(nums) - 1; left < right; ++left, --right) {
            lookup.emplace(nums[left] + nums[right]);
        }
        return size(lookup);
    }
};