Geeksforgeeks

Error

×

Leaderboard

Showing:

Handle | Score |
---|---|

@Ibrahim Nash | 6560 |

@blackshadows | 6400 |

@mb1973 | 5777 |

@Quandray | 5275 |

@akhayrutdinov | 5111 |

@saiujwal13083 | 5074 |

@kirtidee18 | 4398 |

@sanjay05 | 3762 |

@mantu_singh | 3654 |

@gfgaccount | 3601 |

@marius_valentin_dragoi | 3525 |

Complete Leaderboard | |

Handle | Score |

@anish5256 | 991 |

@vimleshpratapsingh321 | 980 |

@skj7 | 899 |

@akhileshkumar562002 | 862 |

@kanewilliamson123 | 854 |

@pradeeppatidar1999 | 852 |

@pd420786 | 813 |

@infilooop | 800 |

@bunnybug320 | 796 |

@smitabose7826 | 784 |

@wallflowe101 | 770 |

Complete Leaderboard |

Given an integer array of **N** elements. You need to find the maximum sum of two elements such that sum is closest to zero.

**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:**

**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.

**Your Task:**

You don't need to read input or print anything. You just need to complete the function **closestToZero() **which takes an array arr[] and its size n as inputs and returns the maximum sum closest to zero that can be formed by summing any two elements in the array.

**Expected Time Complexity: **O(N*logN).

**Expected Auxiliary Space: **O(1).

**Constraints:**

1 ≤ N ≤ 5 * 10^{5}

-10^{6} ≤ arr[i] ≤ 10^{6}

Login to report an issue on this page.

We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?

YesLoading...

Two numbers with sum closest to zero

...