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.
I think we cannot get anything better than O(n), because in case of inserting the largest element, we will have to traverse through all the list anyway.
- ilya.smagin March 16, 2014Correct me if I am wrong, but the answer here is trivial. This would require O(1) memory and O(n) operations.
The special case: all the items are the same, we have to insert an item larger than that. This leads us to another interesting task: finding out the length of the structure. This is still O(1) memory and O(n) operations.