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.
Each prisoner`s rank can be represented by a node and his friends can be depicted by adjoining nodes.
- abhinav bansal February 12, 2015hashmap with key=prisoner : value = Danger rank
Do BFS
for each node hashmap[prisoner]= rank + rank of directly connected nodes
return hashmap
Now this will work only if graph is connected, which if we take kevin bacon`s consideration, every prisoner should be connected to every prisoner