The largest sum

Given an unsorted array of numbers, compute the largest distinct pair sum in the array with only one traversal.

What is the largest distinct pair sum in the text.

Details and Assumptions

For example in the array \([5, 9, 9, 4, 7] \)the largest pair sum is \((9+7=16\)).

×

Problem Loading...

Note Loading...

Set Loading...