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.
14 27 39 50 60 69 77 84 90 95 99 100
- garg.shobhit1 June 23, 2011Maximum 14 throws are required.
Method:
x x+(x-1) x+(x-1)+(x-2)........100
nth term of this series nx-(1+2+3.....till(n-1))
=nx-(n)(n-1)/2
{nx-n(n-1)/2}>=100
for any value of n [1,2,3,4.....]
min value of x which satisfy the equation is 14.
so the answer is 14.
pls guide if i am wrong.