The written round was relatively easy. It contained 20 multiple choice questions on basic c, algorithms and finite automata. Some questions from OS and networking were there too but were easy. Coding questions were:
- Find the nodes of the tree as seen from the left view of the binary tree.
- Rotate the given matrix by 90 degrees i.e. the first row becomes the last column and second row becomes the second last column and so on.
Interview round 1:
Two questions were asked. One puzzle and the other coding question.
- Given n coins for two players playing a game. Each player picks coins from the given n coins in such a way that he can pick 1 to 5 coins in one turn and the game continues for both the players. The player who picks the last coin looses the game. You have to tell that for given n coins who looses the game?
- Given a number n, find the number just greater than n using same digits as that of n.
Interview round 2:
- Given in facebook find an efficient way to find the mutual friends between you and one of your given friends.
Hint: hashing, dictionary data structure implementation
- For two very long numbers given, find the product of these numbers in an efficient way.
Hint: using binary multiplication effectively.
Finally I got internship offer from them….:)
If you like GeeksforGeeks and would like to contribute, you can also write an article and mail your article to email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.