J'ai postulé via la recommandation d'un employé. Le processus a pris 3 semaines. J'ai passé un entretien chez Meta (Menlo Park, CA) en mai 2018
Entretien
Applied through a current employee referral and was contacted for a initial phone call in 2 weeks.
Afterwards, was booked for a technical phone screen. Talked to a very nice engineer who had not been at Facebook for too long. During the interview I was asked two fairly standard coding challenges dealing with strings and arrays.
Went for an onsite 2-3 weeks later. Overall, I think they could have scheduled it a little better. I was told to get there 15 minutes early which is normal and we ended up starting my interview early. (first two rounds were technical coding) We were allotted about 1.5 hr but we ended up finish a bit earlier. Afterwards, I sat in the room for about 30 minutes waiting for someone to get me for lunch. Around noontime, I was picked up for lunch by hiring manager who took me to the canteen to have lunch.
After lunch, I came back to the room to start my interviews again.
Phone screen
easy or medium on leetcode
Onsite
tree, graph, merge segments…
design news feed.
prepared through leetcode, aonecode.
Questions d'entretien [1]
Question 1
Diameter of binary tree. Find number of islands. Meeting room problem.
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