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 would approach it that way:
- dmtrkzkv October 20, 20141. Sort the list in ascending order with nLogn (e.g. QuickSort)
2. Allocate two indexes––smaller and bigger (at the beginning smaller points to the first element of the list and bigger points at the last element)
3. Make a while loop with a termination condition smaller != bigger. Now compute the sum list(smaller)+list(bigger). If it is greater than k, there's no need to find the sums of the rest elements with bigger, so decrement bigger by 1 and continue to the beginning of the loop.
Else if the sum is smaller or equal to k, print out smaller paired with each of the rest of the elements. Increment smaller by 1 and continue to the beginning of the loop.