J'ai postulé via un recruteur. Le processus a pris 1 semaine. J'ai passé un entretien chez Meta en mars 2018
Entretien
I was contacted by a recruiter from San Francisco. After the initial chat, for the second round, a product manager from Seattle office contacted me to do the phone screen. He asked me a question related to sparse vector. I recommended and coded tree solutions including hashing, linked-list and array. Unfortunately, the interviewer was not very knowledgeable. I corrected him in regards to memory management and he made a wrong comment about Dictionary overhead. It is very hard to believe managers like him is able to work at Facebook. It is very unfair that he mentioned giving too many hints to me during the interview as an interview result. I feel very disappointed.
J'ai passé un entretien chez Meta (Londres, Angleterre)
Entretien
Generic LeetCode-style questions, many tagged as Meta, so extensive preparation is required to perform well in the technical interview. The experience varies significantly - some interviewers provide hints and guidance, while others expect candidates to solve problems independently with minimal assistance.
Spoke with interviewer over video conferencing. He was very communicative . He answered my questions. Asked me BFS question. A question that involved BFS search. Given a matrix, I am suppose to find a path from top left to down right.
Questions d'entretien [1]
Question 1
A question that involved BFS search. Given a matrix, I am suppose to find a path from top left to down right.
The technical round hit me with a classic array manipulation problem: moving zeroes to the end without disrupting the order of non-zero elements. As I tackled it, I felt a wave of familiarity wash over me; I had just practiced a similar challenge on PracHub. The rest of the interview followed a straightforward path, with some easy behavioral questions sprinkled in. Overall, it felt very easy, but I wasn’t quite the right fit for what they needed, so I didn’t receive an offer.
Questions d'entretien [1]
Question 1
Move zeroes in an array to the end while keeping non-zero element order, in place