The recruiter initiated the contact, and we scheduled an interview. In general, during this first one, I was asked about my experience and what I had worked with. The recruiter presented Facebook and all the cool stuff we're accustomed to hearing about it. Then she asked two easy technical questions:

• What is a linked list, how does it look, how do you implement it, how does it differ from an array, and can you explicitly state a use case where you would pick a list instead of an array?
• She picks a number between 0-1000 and wants to know what I would do to guess it (binary search).

In the technical interview, I was asked to develop, in 45 minutes, an algorithm capable of printing a tree level by level, with each level on a single line. I did it successfully. The only problem was that when I was about to test it, the interviewer interrupted and said something was wrong, instead of letting me do it, fix it, and then have it happen again.

After finishing the algorithm, he asked me about its time and memory consumption, which I also calculated correctly.

After the test, he opened it up for questions, so he shared a lot about Facebook's culture, projects, career, etc.

Nothing special