Amazon Interview Question for Software Engineer / Developers

Country: India

Comment hidden because of low score. Click to expand.
of 1 vote

I would probably say that maintain a minHeap should be a good way to go !

1.) Assumption is that each paper has the a count that represents the number of times its been read.

Algorithm (basic idea):

1.) Everytime a paper is read. extract the min from the heap, and then check if the count is greater than or equal to the paper extracted from the heap.
a.) If it is greater, search for the paper in the heap O(log n)
b.) change the count to count +1. O(1)
c.) call heapify to reflect the change O(log n)
2.) Obviously, if the count is less than the min paper extracted, just change the count of the paper to count + 1 and don't do anything with the heap.

Note: Heap construction is based on the count (number of times a paper is read).

- Arunav Borthakur November 20, 2012 | Flag Reply
Comment hidden because of low score. Click to expand.
of 0 votes

How is searching a paper in heap be O(logn) when the papers in heap are arranged according to count

- DashDash April 07, 2013 | Flag

Add a Comment

Writing Code? Surround your code with {{{ and }}} to preserve whitespace.


is a comprehensive book on getting a job at a top tech company, while focuses on dev interviews and does this for PMs.

Learn More


CareerCup's interview videos give you a real-life look at technical interviews. In these unscripted videos, watch how other candidates handle tough questions and how the interviewer thinks about their performance.

Learn More

Resume Review

Most engineers make critical mistakes on their resumes -- we can fix your resume with our custom resume review service. And, we use fellow engineers as our resume reviewers, so you can be sure that we "get" what you're saying.

Learn More

Mock Interviews

Our Mock Interviews will be conducted "in character" just like a real interview, and can focus on whatever topics you want. All our interviewers have worked for Microsoft, Google or Amazon, you know you'll get a true-to-life experience.

Learn More