โ† Arista Networks questions

Shortest path in a tree visiting specific subset of nodes

Filed under Arista Networks

The question

Given a tree, determine the shortest path to travel from node 1 to node N such that a given set of nodes is visited along the way. Nodes may be revisited multiple times.

No write-up yet. Related questions below have one.

Related Arista Networks questions

Collected from public candidate posts and coding forums. Updated Nov 2026.