It was discussion only. Proposed DFS to find starting points (as graph can have disjoint trees). And then print the path. It was impromptu discussion - i felt we had decent discussion on graph traversal (DFS) and adjacency list. Parking lot was a std discussion, extensible problem statement and soln.