Adobe Interview Question for Applications Developers

Country: United States
Interview Type: In-Person

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

Seems to be an ideal situation to use indexes that you can store in memory. Build indexes using B+ trees. Like each index points to blocks of 100 nodes in the linked list each. Save these indexes in memory. So your actual disk access would eventually be minimal for what you want to search. B+ trees are designed to save you time spent on sequential access. So if the indexing is done smartly you can even save the entire resultant block from the core dump file in memory and do the search which would take just one disk access.

- keshi July 05, 2012 | 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