Given an array of integers, find a pair whose sum equals K. If multiple pairs exist, return the index of the pair that contains the maximum individual element among all valid pairs.
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.