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 use combination of doubly linked list and hashmap of <value,node>;
- priyank doshi October 08, 2013Each time we add a node in DLL , we will add it into hashmap also.
now lets see how it gives o(1) complexity.
1) insert is ofcource O(1). insert at frond or rear.
2) we can search in hashmap for the desired node.
3) look up in hashmap . if node present than get the node from hashmap. Since its a doubly link list , and we have pointer of node to be deleted , we can delete from DLL in O(1).
4) I am not sure what they expect in this one.