An Array of integers is given, both +ve and -ve. You need to find the two elements such that their sum is closest to zero.
For each element, find the sum of it with every other element in the array and compare sums. Finally, return the minimum sum.
Two elements whose sum is closest to zero: https://www.geeksforgeeks.org/two-elements-whose-sum-is-closest-to-zero/