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.
Search for a pair which sums to S
- basavesh.logan January 08, 2012Let A be a sorted array of integers ans S a target integer
Problem: Design an efficient algorithm for determining if there exist a pair of indices i,j (not necessarily distinct) such that A[i] + A[j] = S
SOL:
store the values from the array in a hashtable, then for each new value, check to see if its complement has already been seen and if so, what is the index.