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.
[AMAZON] Vertical sum of nodes
Given a Binary Tree, find vertical sum of the nodes that are in same vertical line. Print all sums through different vertical lines. Examples: 1 / \ 2 3 / \ / \ 4 5 6 7 The tree has 5 vertical lines Vertical-Line-1 has only one node 4 => vertical sum is 4 Vertical-Line-2: has only one node 2=> vertical sum is 2 Vertical-Line-3: has three nodes: 1,5,6 => vertical sum is 1+5+6 = 12 Vertical-Line-4: has only one node 3 => vertical sum is 3 Vertical-Line-5: has only one node 7 => vertical sum is 7 So expected output is 4, 2, 12, 3 and 7
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