Bootcamps
Masterclasses
Menu
Courses
Account
Login / Sign Up

Pair Sum Closest to 0

Easy Acceptance 19.61% Points 20

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
Example 1

Example 1

Input: N = 3, arr[] = {-8 -66 -60}

Output: -68

Explanation: Sum of two elements closest to zero is -68 using numbers -60 and -8.

Example 2

Example 2

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.

Constraints
  • 2 <= N <= 5 * 10^5
  • -106 <= arr[i] <= 106
Hints
  • Expected Time Complexity: O(N*logN).
  • Expected Auxiliary Space: O(1).
Topics
Searching Algorithms
Companies
Amazon Microsoft Salesforce Accenture
Added 11 Apr 2025 19.61% acceptance
Ln 1, Col 1Sign in to save your code
3
-8 -66 -60
-68