Search
⌘K
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.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.