Divisible by 10
Given a stream of binary digits how can you tell if the number formed is divisible by 10.
[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
it is divisible by 10 if it ends with 1010
ReplyDelete@gaurav i don't think it will work,check for 20,it is 10100.so it does not ends with 1010.
ReplyDeletecan u please tell the answer.i am having no clue except calculating the decimal equivalent..
ReplyDelete@kams Here's the clue :Look at powers of 2 modulo 5:
ReplyDelete2^0 = 1 = 1 mod 5
2^1 = 2 = 2 mod 5
2^2 = 4 = -1 mod 5
2^3 = 8 = -2 mod 5
2^4 = 16 = 1 mod 5
now it repeats ...
(Two numbers are equal, or more properly "congruent," modulo 5, if
they give the same remainder when they are divided by 5..now try it..:)