Amazon Interview Report
- 0of 0 votes
AnswersGiven an array of integers, the function should return an array, with each position having the product of all other numbers than itself.
- scorpionking September 18, 2012 in India
Corner cases have to be handled| Report Duplicate | Flag | PURGE
Amazon Software Engineer / Developer Algorithm - 0of 0 votes
AnswersFind the first occurance of a number in a sorted array.
- scorpionking September 18, 2012 in India| Report Duplicate | Flag | PURGE
Amazon Software Engineer / Developer Data Structures - 2of 2 votes
AnswersWhy Amazon?
- scorpionking September 18, 2012 in India| Report Duplicate | Flag | PURGE
Amazon Software Engineer / Developer Behavioral - 0of 0 votes
AnswersHow many unique BST can be made from a series of numbers 1,2,3,4,....n
- scorpionking September 18, 2012 in India
The input is N| Report Duplicate | Flag | PURGE
Amazon Software Engineer / Developer Algorithm - 0of 0 votes
AnswersGiven a tree, link all the siblings from right to left.
- scorpionking September 18, 2012 in India| Report Duplicate | Flag | PURGE
Amazon Software Engineer / Developer - 0of 0 votes
AnswersWhich data structure would you use for optimum addition removal, querying and priority.
- scorpionking September 18, 2012 in United States
(Heap, Hash and BST were rejected )
ok after finishing the interview, he finally told me the answer: he said that with each node we must store the min and max child.
his opinion was: Hash has good insert query complexity, but bad priority wise retrieval.
BST has logn for all the operations
Heap just ensures that the top priority is at the top (not the next order)
no wonder i got a reject :P| Report Duplicate | Flag | PURGE
Amazon Software Engineer / Developer Data Structures