Dataford
Interview QuestionsInterview GuidesExperiencesMock InterviewsPricing
Get started

Shortest Path Graph Traversal

Hard
HardCodingbfsAlgorithmsGraphs
Asked 2mo ago|
Starr Companies
Starr Companies
Asked 1 times

Problem

Solve a classic graph traversal problem, such as finding the shortest path in a network, and explain your choice of algorithm.

Practicing as: Software Engineer interview at Starr Companies

Hi, I'll play your Starr Companies interviewer for the Software Engineer role. Candidates describe these interviews as mostly positive and moderately difficult, so expect me to be friendly and conversational. Take your time with the question above and answer like we're in the room.

Take this as a live interview session →

You are practicing as a guest. Sign up free to get your answer graded with AI feedback. Your draft stays right here.

Sign up freeI have an account
Sign up to unlock solutions
Starr Companies Software Engineer Interview QuestionsStarr Companies Interview Questions
Next questions
Henderson EngineersShortest Path in a GraphHardBear RoboticsGraph Traversal Shortest PathMediumImpact AnalyticsShortest Path via Graph TraversalMedium