Two elements with minimum sum

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 the below array, program should print -80 and 85.


  1. this just need to trace the array two time :
    first time : find the maximum among negative integer's (including 0 ,if present in the array).
    second time : find the minimum among positive integer's (excluding 0).
    and just both of these ,you will find the solution.

  2. sum the max and min to find the answer.

  3. @gaurav in the second parse you said find the minimum among positive integers which is 1 according to your algo it should give -80 and 1.


Post a Comment

Popular posts from this blog