
# Documentation

##  Two numbers with sum closest to zero

<a><img src= "https://img.shields.io/badge/-Snapdeal-black" height="25">&nbsp;&nbsp;<img src= "https://img.shields.io/badge/-Microsoft-orange" height="25">&nbsp;&nbsp;<img src= "https://img.shields.io/badge/-Amazon-red" height="25">&nbsp;&nbsp;<img src= "https://img.shields.io/badge/-Python-brightgreen"></a>

#### Problem Statement

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



    Example 1:
    
    Input:
     3
     3
    -8 -66 -60  
     6
    -21 -67 -37 -18 4 -65  
     2
    -24 -73

     Output:
     -68
     -14
     -97
    








#### Solution

To be added soon ... .. ...
