Two technical interviews. The first asked one coding question on SQL and I answered in Java. The second asked about resume and a few algorithm questions, one of which is to determine is there is a person within six connections from you in the social network. Solution is to start BFS from both people and each traverse every node at most three edges away.
