Interview Question
Software Engineer / DevelopersCountry: India
Interview Type: In-Person
seems good...plz clarify this,..let's say u hv two paths from 1 to 6..
1->3->6
1->2->4->3->6
then which edge is gonna be removed?
seems good...plz clarify this,..let's say u hv two paths from 1 to 6..
1->3->6
1->2->4->3->6
then which edge is gonna be removed?
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.
1) First Find the shortest path between two nodes E1->E2->E3 ....
- Maher Rezeq September 25, 20122) For all the edges : Remove one and calculate the shortest path agin store the path in array with it's weight
path1= {E1,E2, ... En, pathWeight}
pathsArray.add(Path1);
3) then sort the pathsArray depending on pathWeight of the path and get the Kth path you want