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.
Can this be done in greedy approach?
- arrantinsane March 10, 2014Step 1) Maintain an array of vertices with number of edges incident.
and thus the asnwer consist of all the vertices.
Step 2) Remove the vertex with maximum number of edges incident.
Step 3) Update the array
Step 4) Keep on repeating step 2 and step 3 untill we reach to a stage where the remaing vertices has no edge incident. The remaining vertices are the answer.