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 there is several places where you have O(n^2).
- JoeTheDentist May 13, 2014Your first loop creates a string copy at each iteration, thus O(n^2) and not O(n).
Your sort (witch probably uses qsort that is worse case O(n^2)) is using string's compareTo that depends on string length, worse case is something like O(n^2) or worse.
Last, the two loops can be proportional to n. Think of an input that has always the same character, your inner loop will always reach the end of each strings. Thus O(n^2).