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.
Shouldn't the worst case complexity be approxO(n2). When total number of comparisons is: (n2-n)/2. Consider the case when the celebrity is at the end of the row. And except everyone (other than celebrity) don't knows each other except celebrity. In a,b,c,d,e. If e is celebrity and if we start from a:
- avi February 18, 2014Comparisons will be:
a-b
a-c;b-c
a-d,b-d,b-c
a-e,b-e,c-e,d-e