Zillow Interview Question

Country: United States

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

I would use a combination of a doubly linked list, a hash table and a min heap.
The hash table maps from a property to its location in the linked list. The linked list holds the items in order, and when an item is viewed it is moved to the end of the list. The list also points for each item to its location in a min heap of size 100 (not all properties are in the heap). I would have a routine that would periodically remove items from the list based on the time (and update the rest of the data structures). When a property is viewed, it is added/updated in the hash table. It is put at the end of the linked list with its new time. Then we compare the number of views for that item with the top of the min heap. if it is larger, we pop the top of the min heap and insert the new item to the heap.

- Lively May 16, 2016 | Flag Reply

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