check for overflow
find the sum of two numbers and check for overflow.
both the numbers are within integer limit but their sum may exceed.
both the numbers are within integer limit but their sum may exceed.
[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
int first,second;
ReplyDeletecin>>first>>second;
//since int has 2^32-1 values
int x = 2^32-1;
int diff = x-first;
if(diff <second){
cout<<"sum will give overflow";
}else{
cout<<first+second;
}