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.
Given an integer n, write a function that returns count of trailing zeroes in n!. Examples: Input: n = 5 Output: 1 Factorial of 5 is 20 which has one trailing 0. Input: n = 20 Output: 4 Factorial of 20 is 2432902008176640000 which has 4 trailing zeroes. Input: n = 100 Output: 24
this just need to trace the array two time :
ReplyDeletefirst 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.
sum the max and min to find the answer.
ReplyDelete@gaurav in the second parse you said find the minimum among positive integers which is 1 here.so according to your algo it should give -80 and 1.
ReplyDelete