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.
hashmap
- Ravikanth Samprathi March 18, 2014have a hash table with a pointer pointing to a node in a queue. The queue's head is least recently used.
everytime you insert, check if cache limit is hit. If hit, remove head of queue and insert the new file in the hash record, add node in queue tail and update hash pointer to queue tail.
This is fine if there are no hash collisions, but with collisions, each bucket should have another hash table or heap-tree. But with heap-tree O(1) cannot be done. With second level hierarchical hash, collisions cannot be prevented.