LeetCode Question · Dec 2016

Airbnb | Shortest path in a directed graph that can visit each vertex at least once

1 upvote 3,535 views 4 replies

Question Details

Find a shortest path in a directed graph that can visit each vertex at least once. Not TSP (no visit restriction and no cycle requirement)

Full Details

🔒

Unlock full leaked content

Full insider details, leaked discussions, and candidate experiences.

Get Premium →

Topics

Graph