Worst Case Time to Reach Destination
Filed under Nutanix
The question
In an undirected graph, move along the shortest path to a destination. If not at the destination, move to a random adjacent road (excluding the one you arrived from) and repeat. Find the worst-case time to reach the destination.
No write-up yet. Related questions below have one.
Related Nutanix questions
Collected from public candidate posts and coding forums. Updated Nov 2026.