Chronus Interview Question for Applications Developers

Country: India
Interview Type: Written Test

Comment hidden because of low score. Click to expand.
of 0 vote

can u be more specific..? is the graph directed, weighted(or all edges of same wt.), can i have negative edge.. etc... however below is a possible(not the best solution):

- given a source vertex 's' run dijkstra's algorithm.. it would give you all shorted paths from s to every reachable vertex in the graph.
Note: shortest distance from 's' can be stored in every vertex as its attribute
-iterate over all the vertices. and find the 2nd shortest path

Complexity: dijkstra's O(E+V logV) + O(V) = O(E + V logV)

- October 05, 2012 | Flag Reply

Add a Comment

Writing Code? Surround your code with {{{ and }}} to preserve whitespace.


is a comprehensive book on getting a job at a top tech company, while focuses on dev interviews and does this for PMs.

Learn More


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.

Learn More

Resume Review

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.

Learn More

Mock Interviews

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.

Learn More