I met an FB recruiter at a conference and then set up the first phone interview two weeks later.

The first question was to write an algorithm such that if an element in an M*N matrix is 0, its entire row and column are set to 0. The second question was about BFS.

I received an email one week later informing me that I had passed the first interview and was ready to schedule a second phone interview. Then, I waited for a month until I finally got a reply.

In the second interview, the first part was mainly based on my current published paper. The second part was a coding problem related to finding combinations of a sequence of numbers produced by a six-sided die.

no particular difficult questions