Shortest walk visiting all nodes
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]]) → intExamples
in
[[[1,2,3],[0],[0],[0]]]out4What 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.
0:00 of about 40 min
solution.py
InputExpectedGot
[[[1,2,3],[0],[0],[0]]]4not run yetsample