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.
1) iterate through the array -- put each value into a hashtable (the key is input[i], the value is the number of times that value has occurred)
- natty July 09, 20122) iterate through the array again -- int myValue = sum-input[i]
3) if myValue == input[i], then make sure myValue occurs in the array more than just once. if it does, then that's a pair
4) if myValue != input[i], then if myValue occurs in the array 1 or more times, then that is a pair.