Amazon Interview Report
- 0of 0 votes
AnswersFind level wise linked lists in a BST.
- Naveen Reddy Mandadi August 25, 2012 in United States
Example: 1 has children 2 and 3
2 has children 4 and 5
3 has children 6 and 7
6 has children 8 and 9
then the algorithm should give the below
result[0] = 1
result[1] = 2->3
result[2] = 4 -> 5 -> 6 -> 7
result[3] = 8->9| Report Duplicate | Flag | PURGE
Amazon Applications Developer Algorithm - 0of 0 votes
AnswersThere are n nodes with a value in each node.
- Naveen Reddy Mandadi August 25, 2012 in United States
Communication between two nodes can happen any time to pass the node value from one to the other, every communication takes 1 second.
Whenever communication happens from node a to node b, node b's value can be changed based on node a's value.
One node cannot participate in communication to two other nodes at any point of time.
At any point of time each node can hold only one value.
We need to end up with "sum of the values in all the nodes" as the value in all the nodes, how much time is required?| Report Duplicate | Flag | PURGE
Amazon Applications Developer Algorithm - 0of 0 votes
AnswersFind common ancestor of two nodes which has least value.
- Naveen Reddy Mandadi August 25, 2012 in India| Report Duplicate | Flag | PURGE
Amazon Applications Developer Algorithm