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.
The question can be solved with constant space and O(a+b) runtime, given that the arrays are sorted (a is the length of array1 and b is the length of array2). The idea is the start one pointer at the beginning of array1 and another at the end of array2. You increment pointer1 when the current sum is less than the target (thus increasing the sum) and decrement pointer2 if current sum is greater than the target (thus decreasing the sum). This method also ensures no pairs are missed
- deepan.saravanan83 September 06, 2016