First were a pair of online coding questions, 45 minutes each and with no efficiency requirements.

About two weeks later, there was a pair of phone interviews using Google Docs for shared coding. Each was 45 minutes and they were back-to-back.

Two weeks later, they got back to me and scheduled two more phone interviews. As I understand it, this was unusual and might have been because I struggled on the second interview.

About two weeks after that, I received an automated email denying me.

You have an undirected acyclic graph and are playing a game. Both players select a node, then take turns claiming all nodes connected to theirs. The winner is the player who ends up with the most nodes.

Q1. Assuming you go second, write an algorithm to choose the optimal node.

Q2. Assuming you go first, write an algorithm to choose the optimal node.