An attempt for the following challenge at HackerRank: https://www.hackerrank.com/challenges/find-the-nearest-clone/problem
Creates an adjaceny list representation of the given graph. Instead of explict looping over all the nodes, 1 step hops are considered at each timestep. The node from which successors are generated are maintained at each timesetep to avoid backtracking.