Amazon Interview Report
- 0of 2 votes
AnswersWhich data structure is preferred for performing concurrency, serialization out of BST and Hash-Table.?
- Srikanth February 15, 2013 in United States| Report Duplicate | Flag | PURGE
Amazon Software Engineer / Developer Data Structures - 0of 0 votes
AnswersGiven a BST and a node, write a function to find the next biggest element in the BST in preferred language.
- Srikanth February 15, 2013 in United States| Report Duplicate | Flag | PURGE
Amazon Software Engineer / Developer Data Structures - 0of 0 votes
AnswersCompare the space complexity of BST and Hash-Table.
- Srikanth February 15, 2013 in United States| Report Duplicate | Flag | PURGE
Amazon Software Engineer / Developer Data Structures - 1of 1 vote
AnswersA tree-map is implemented using BST, the complexity of search in a tree-map is guaranteed to be O(logn). How is that case of search complexity O(n) [obtained when the BST is like a linked list from the root node, only in single side] in BST avoided in tree-map.
- Srikanth February 15, 2013 in United States| Report Duplicate | Flag | PURGE
Amazon Software Engineer / Developer Data Structures - 0of 0 votes
AnswersDesign a Cache System, with the appropriate data structure and operation with the time complexity.
- Manoj Singhal April 02, 2013 in India for Kindle| Report Duplicate | Flag | PURGE
Amazon Senior Software Development Engineer Algorithm - 0of 0 votes
AnswersDesign a Text Editor, in term of class diagram and data structure required to store the data/text and Insert, Delete, search in both direction and Edit operation. Calculate the time complexity for all operation.
- Manoj Singhal April 02, 2013 in India for Kindle
Note: the size of file is huge and we don't have the RAM to load entire file into a memory.| Report Duplicate | Flag | PURGE
Amazon Senior Software Development Engineer Object Oriented Design