Shortest path that avoids blocked nodes
Given an unweighted graph, a start node and a set of blocked nodes that cannot be entered, return the shortest distance from the start to every node (or to a given end node), with unreachable nodes marked as such. Run BFS that skips blocked nodes, and handle a blocked start or end.
GoogleTechnical phone screenNo answer yet. Write the first one; the best answer gets endorsed.