Les candidats postulant à un poste comme Software Engineer chez Meta attribuent un niveau de difficulté de 3,3 sur 5 (5 étant le niveau de difficulté le plus élevé) à leur expérience d’entretien et sont 50 % à l’évaluer comme positive. À titre de comparaison, la moyenne pour l’ensemble de l’entreprise est de 59 % d’avis positifs, d’après les évaluations Glassdoor.
Les candidats postulant à un poste comme Software Engineer mettent en moyenne 32 jours pour être embauchés, d’après les 6 entretiens partagés par les utilisateurs pour ce poste. À titre de comparaison, le processus de recrutement chez Meta prend en moyenne 32 jours.
D’après 6 entretiens Glassdoor, les étapes typiques du processus d’entretien d’embauche pour un poste comme Software Engineer chez Meta incluent :
Entretien téléphonique: 43 %
Entretien individuel: 29 %
Test des compétences: 29 %
Voici les rôles les plus recherchés pour les rapports d’entretien -
J'ai postulé via la recommandation d'un employé. Le processus a pris 4 semaines. J'ai passé un entretien chez Meta (Menlo Park, CA)
Entretien
I'm interviewed as new grad. First, there was a phone interview. Then I was invited to attend facebook university day onsite interview. The difficulty is not high for new grad, but please review the questions you have solved before, and make sure you firmly remember the process of solving those issues. If a follow up question stops you, you could choose to back up and think the question as new question and cut the connection with previous thought.
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