is a comprehensive book on getting a job at a top tech company, while focuses on dev interviews and does this for PMs.
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.
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.
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.
You may use a hash table which has the advantage of the o(1) lookup time. However since we also need to find all names and phone numbers between two names the hash function should be such that h(x) should be either monotonically increasing or monotonically decreasing.
- Anonymous April 08, 2009Also you may use a binary search tree which has nlogn search time complexity and the process of implementing the given operation will be easier.