Associated Course(s):
Interview Preparation

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

**Input:**

The first line of input contains an integer T denoting the number of test cases.

The first line of each test case is **N**,** **denoting the size of array. Each test case consist of a N integers which are the array elements.

**Output:**

Print the requiired sum which is closest to zero.

**Constraints:**

1 ≤ T ≤ 100

1 ≤ N ≤ 10^{3}

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

**Example:
Input**:

3

3

-8 -66 -60

6

-21 -67 -37 -18 4 -65

2

-24 -73

**Output:**

-68

-14

-97

**Explanation:**

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

bhatabhi554 | 32 |

dayman | 28 |

SunkyuHwang | 26 |

sidshahz1 | 24 |

bently_nixon | 24 |

blackshadows | 918 |

SunkyuHwang | 794 |

bently_nixon | 679 |

Shaurya Khanna | 490 |

JojiJoseph | 470 |

akhayrutdinov | 5043 |

Ibrahim Nash | 4959 |

blackshadows | 4618 |

Quandray | 4354 |

sanjay05 | 3668 |

Login to report an issue on this page.