CodingHardcod-g928

Subject BfsLevel Senior–Staff~40 minCommon in Algorithms & data structures interviewsIndustries Software development

Question

You are given an undirected, connected graph of n nodes (0..n-1) as an adjacency list. Return the length of the shortest walk that visits every node at least once. You may start and stop at any node, and you may revisit nodes and re-traverse edges (each edge traversed counts as 1 step). For n==1 the answer is 0.

Implement

shortest_path_all_nodes(graph: list[list[int]]) → int

Examples

in[[[1,2,3],[0],[0],[0]]]out4

What a strong answer looks like

State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.

Learn the concepts

Vibe coding: describe the solution in plain language (or narrate it) and the coach grades your approach. Generating runnable code from your description is coming next.

Run or narrate your approach, then ask the coach.