Amazon Interview Report
- -4of 4 votes
AnswersA student needs to implement a BST structure to solve a problem, but instead he used a linked list. New value will always be added at beginning of a linked list. So basically at each step after insertion , root of BST and head of link list should point to same node. Then give an example of input sequence, in which his implementation works…
- Vin October 08, 2013 in India| Report Duplicate | Flag | PURGE
Amazon SDE1 - 1of 1 vote
AnswersDesign a DS to perform
- Vin October 08, 2013 in India
1. Insert
2. Search
3. Delete
4. Get Random
All in O(1).| Report Duplicate | Flag | PURGE
Amazon SDE1 - 0of 2 votes
AnswersGiven an array consisting of both positive and negative numbers, 0 is considered as positive, rearrange the elements such that positive and negative numbers are placed alternatively, constraints are that it should be in-place and order of elements should not change.
- Vin October 08, 2013 in India| Report Duplicate | Flag | PURGE
Amazon SDE1 - -2of 2 votes
Answersn1 pairs of “{} ” brackets
- Vin October 08, 2013 in India
n2 pairs of “[] ” brackets
n3 pairs of “() ” brackets
Print all valid combinations of all the pairs| Report Duplicate | Flag | PURGE
Amazon SDE1