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.
What eugene is saying is correct, the intent of the original problem was to print out a combination of all players (with no players repeated). I was stuck at the point thinking whether a solution to this always exists or not. Also normal sorting algorithms won't work in this case, as i+1 has relation to only i, and no relation to i-1, so there is no global sorting parameter here.
- anuj78 April 23, 2012