You Should use TRIE data Structure for Implementing Phonebook. See the solution here: goo.gl/DJNPvi
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.
We can have two data structures
- $ETN$ January 01, 20151. A Dictionary<phonenum, <Customer>> - This will serve first requirement of query of phone num
2. For query by name (exact match as well as prefix match) - We can use a Trie. Apart from storing alphabet, each node in Trie will have an list of phone numbers. For all the nodes that represent complete word, this list will have the corresponding phone number.
When there is a word or prefix match, phone numbers from the list in this node can be quickly searched in the Dictionary to return corresponding customers.