most-event-visits This is a solution to an interview problem I faced. I used a generic DFS implementation and by adding a 0th node to all subsequent nodes, I am able to find the most events visited without an overlap.