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 C++ version of the algorithm. This will work even if the iterator is neither random access nor bidirectional, a little more generic than what was asked, but works and does a little more :) For the example I use the new C++11 forward_list to demonstate this point. The return value is one past the last value of the sorted list with the duplicates removed, as is the C++ style for iterators and algorithms. Let me know what you think :)
- mrenaud92 September 10, 2012