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.
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
Please log in to access the Submissions tab, where you can review your progress and explore code submissions from other participants.
Please log in to access the Solution tab and view detailed answers and explanations.
Please log in to access the Discussion tab and join conversations with other participants.