Amazon Interview Report
- 0of 0 votes
AnswersA queue is implemented using a circular list. If only one pointer is given to which node a pointer p should point such that enqueue and dequeue operation could be performed in o(1).
- Saabu October 13, 2012 in India
options are
1) Rear
2)Front
3)Node next to front
4) one more option was there| Report Duplicate | Flag | PURGE
Amazon None None Algorithm - 0of 0 votes
AnswersThere are three operations on a stack. push, pop and one extra operation reverse that will reverse the element in stack. Using this we have to implement a queue. so for Enqueue and Dequeue operations how many operations on stack are needed.
- Saabu October 13, 2012 in India
options are
1) 3,3
2) 1,1
3)1,3
one more option was there i don't remember| Report Duplicate | Flag | PURGE
Amazon None None Algorithm
CareerCup is the world's biggest and best source for software engineering interview preparation. See all our resources.