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.
Hi Veeru, I am explaining question and answer as well.
- gaurav.gau December 15, 2011i/p:
4 : count of numbers
4 5 7 10 12 13 : Pairwise sum
o/p: 1 3 4 9 : 4 numbers whose pair wise sum was given
4 == 1+3 (Pair wise sum of 1 and 3 is equal to 4 )
5 == 1+4
7 == 3+4
10 == 1+9
12 == 3+9
13 == 4+9
-----------
71== 3 *(1 + 3 + 4 + 9)
(Sum of the pairwise sum of n whole numbers) = nC2 * (Sum of n whole numbers)
With this we can find (Sum of n whole numbers).
and also we can find all n whole numbers.