These are the graph problems every placement candidate should be able to solve, from counting links to a word ladder. Decide first whether the input is a graph or a grid, directed or not, and whether the question asks for the fewest steps or only for reachability. Trace a small input on paper, then test your program against every case.
