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 don't know where you get your numbers from, but I tried his solution with the same size input you specify and the number of steps I counted is 11021695. If you want to include the the number of steps taken to sort the array, this amounts to 11021695 + 4608 which is no where close to the numbers you are implying.
This is the code
Just to make sure, I did the same thing with the brute-force method and lo and behold, I get 44347135 which is larger than what you proposed, making the first one 400% faster than this
- smac89 December 08, 2015