Minimum Moves to Reach Home in a Graph
Filed under Nutanix
The question
A city is represented as a graph with V junctions and E roads. Starting from an office junction, at each step a random/rational choice of road is made (without immediately returning along the same road) to reach a house junction. Determine if the house can ever be reached and find the minimum number of moves using the best strategy.
No write-up yet. Related questions below have one.
Related Nutanix questions
Collected from public candidate posts and coding forums. Updated Nov 2026.