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.
Initially start with the node which has more fuel than its distance to it adjacent nodes and than apply Minimum Spanning Tree (MST) algorithm to Traverse through all the nodes. The MST will give us the optimal path from one node to it adjacent nodes, and this will apply for all the nodes. As we walk through the Nodes we will keep track of how much fuel we have and what distance have we covered or have to cover. At any point if the distance we have to cover is greater than the fuel we have, we will have to exit and start from the beginning.
- azhar.rao May 06, 2013The second time we will choose the Node who has the second most fuel but still the fuel should be greater than its distance to the adjacent nodes. And than again apply Minimum Spanning Tree.
In this problem we cannot choose the initial node unless we have Traversed through the complete tree.