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.
There is a sorting algorithm called external merge sort that can help you with this. Essentially in the beginning you sort the two smaller arrays using something like quicksort, so you have 1 = {2,5,8,9} and 2= {1,3,4,6,7}. Then you check the first element of both arrays, and put the smaller in the third array: min(1[0], 2[0]), so now you have 3 = {1}. Then you "advance" to the second element in the array that you used, and now compare the second element of that array and the first element of the other array, so you check min(1[0], 2[1]). So now array 3 looks like 3 = {1,2}.
- cemkadioglu91 April 03, 2015