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.
For real?? And this is the way they want to measure candidates? Shame...
- Sergey October 21, 20161. Qsort complexity (worst or avg) belong to class of functions O(e^n). Simply by definition of that class. In other words Big O notation means "grows asymptotically no faster than ...".
2,3,4. Disputing questions... From my perspective Big O notation or asymptotic complexity analysis is a very good way to measure different approaches. However, it is not the ONLY one property of algorithm complexity analysis.
I would mention algorithms with same asymptotic and different constants.
5. Insertion sort will be good enough.
6. Counting sort because of small set of different unicode chars
P.S. This questions shows nothing about candidate skills. Even if you don't know answers you still could be good candidate and vice verse.