Twitter Interview Question Software Engineer / Developers
2of 4 votesImplement LRU cache.
Country: United States
Interview Type: Phone Interview
Implement LRU cache.
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 need:
- Arjan August 16, 20131) HashTable
2) Doubly LinkedList
Each entry will have the key mapped to a struct that includes {data, prev, next} via hashmap
You also need 2 placeholder pointers: MostRecent and LeastRecent (I call them hi and lo)
When you insert entries, link the 'hi' entry to the newest entry and vice versa. update the 'hi'
When you fill up the cache (ie the array/hashmap capacity) then:
1) if you get a new data entry request (cache-miss), put it in place of 'lo' entry, and update the next and prev pointers (using hi.prev and lo.next) Update 'hi' ofcourse.
2) if you get a previously entered data request (cache hit) then goto that entry (use hashmap's O(1) access) and update the prev and next pointers for that entry (using entry.prev and entry.next, hi.next) update 'hi'
Good God, this is much easier to explain on paper.