Problem Submissions Solution
Pair Sum Closest to 0
Difficulty: Easy
Acceptance: %
Points: 20.00
Given an integer array of N elements. You need to find the maximum sum of two elements such that sum is closest to zero.
Examples:
Input: N = 3, arr[] = {-8 -66 -60}
Output: -68
Explanation: Sum of two elements closest to zero is -68 using numbers -60 and -8.
Input: N = 6, arr[] = {-21 -67 -37 -18 4 -65}
Output: -14
Explanation: Sum of two elements closest to zero is -14 using numbers -18 and 4.
Expected Time Complexity: O(N*logN).
Expected Auxiliary Space: O(1).
Constraints:
- 2 <= N <= 5 * 10^5
- -10^6 <= arr[i] <= 10^6
Companies:
Amazon Microsoft Salesforce Accenture
Topics:
Searching Algorithms
