Questions I had was BFS/DFS implementation for a certain graph problem, then again some kind of removing duplicates from the array (but this time with some extra constraint - cant really remember) and third round was some kind of phonebook search algorithm where you only discuss and don't actually code anything, but you draw on a white-board and talk about the problem. The solution to the problem turned out to be a prefix tree, which I have never implemented (and knew not much about it) but during the problem solving process I managed to come up with the this structure.
