Find K pairs with largest sum in an array
Filed under Sprinklr
The question
Find K pairs with the largest sum from arrays within a required time complexity of O(nlogn).
No write-up yet. Related questions below have one.
Related Sprinklr questions
Collected from public candidate posts and coding forums. Updated Nov 2026.