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.
A hash table is an associative container that maps a key to a value. a key can be a string or anything that has a operator==() and hash() function defined.
- chennavarri November 09, 2010In addition, to ensure maximum performance, the hash function should be designed in such a way that if x != y
Very useful when insertion is done once and primarily used for searching using a key.
For implementing a hash table, things to keep in mind:
Choosing a hash function.
Data structure which can dynamically resize, [vectors or array lists]
Taking care of collisions