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.
@ChrisK, i think your idea works and i just elaborate with a 3-step solution as follows:
- cong.doan November 20, 2017Step 1. Construct the undirected graph where each vertex is an element from the given set and each edge is a relation from the list.
Step 2. Compute all the connected components of the graph.
Step 3. Count those components of size 1 (i.e. single-vertex components), and this count is actually the answer to the problem.