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.
Here is the logic I followed for the code below
for each player i from 0 to (n-1), do the following steps
1) Check whether any fan contains only player i in its list. If so, this player has to be in the output. Add this player to output list.
2) Remove all fans liking player i (since this player is in the output list).
3) Also remove the player i (i.e. set bit i = 0) for all remaining rows (This is done irrespective of whether player i is in output list or not. Player i wont matter in further decision making)
4) If during this process, the number of rows (fans) becomes 0, we will stop and print the output list. This is the minimum set.
- Ajay November 26, 2013