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.
@eshank rastogi: Your answer is half complete. You would use binary search for the first egg and linear search for the second egg. Let me elaborate:
- whatdoichooseforusername December 14, 2012When you check by dropping the first egg from floor 50 for example; if the egg breaks you wouldn't get the answer as you implied (correct me if I misunderstood). You would then go on to search linearly with the second egg preferably starting from the lower floors to find the highest floor from which dropping the egg won't break it.
@Anonymous: If you look around yourself, algorithms are everywhere. There is nothing wrong with Eshank's answer. And if you do like to call people dumb using an anonymous moniker then why don't you present your "better" solution.