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.
First idea could be: calculate all the distances in an array, sort the array,
then get the k smallest values from there. This would work fine, but as the
fastest sorting algorigthms are O(nlog(n)), there is a faster, O(n) solution.
While iterating over the array you fill a max-heap of length k with new values.
The exact implementation of the heap was not asked.
In PHP:
- k October 17, 2013