Final round, coding interview: given a web framework and a root node in a map, make an endpoint which returns a list of each node and its corresponding neighbors in the map. Follow up question: make an endpoint which accepts a specific target node and returns its neighbors in the map.
Anonymous
Simple DFS/BFS implementation, for the follow up question you could cache the results from the first question
Check out your Company Bowl for anonymous work chats.