The second question was a bit confusing. Suppose you have a facebook API, which allows you to access all one's friends. Can you find if B is connect to A through friend's network? say A has friends (C,D,E) and C has friends(B,G). Now A is connected to B. I did the second one with a 7 layer for loop first, 'cause I was avoiding overloading the memory with too much data. However, the interviewer seems not to appreciate that. But I did answer the following up question wrong. He asked what is the big O for my code. A map search is N(nodes)+V(edge). I did not know that, I gave a answer of N, which is close but not correct.
