Leetcode 1679. Max Number of K-Sum Pairs

Given an array and integer k, maximize the number of disjoint pairs whose elements sum to k — a frequency/ complement-matching problem (can be solved with hashing or two-pointer after sorting) for n up to 1e5.