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.
Hashtable + a vector for quickly getting random elements seems an appropriate solution, with the following additions:
* keep the index of the array in the hash table, for fast deletions from the array
* delete from the array by swapping with the last element and then deleting last element, to make this operation o(1)
C++ solution is below.
* Assuming the elements you are storing are integers.
* Variable names could have been better.
* Handle collisions by "chaining" in a vector (easier to implement than linked list).
- andrei08ionescu October 21, 2012