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.
Here is a C implementation, which is an O(n^2) algorithm, the first step is calc the difference between two array, and then, if the sum of the difference array is not zero, you pick the closet element around the value of half of the total difference, keep going. As long as the partition is possible, you will reach the point that sum difference is zero in at most n steps.
- nwang.cooper January 16, 2014