Perguntas frequentes de entrevistas da empresa Meta
Candidatos do cargo de Software Engineer classificaram o processo de entrevista da empresa Meta com 3,5 de 5 (no qual 5 é o maior nível de dificuldade) e a experiência da entrevista como 62% positiva. Para fins de comparação, a média da empresa é 67,3% positiva, segundo as classificações de usuários do Glassdoor.
O processo de contratação do cargo de Software Engineer dura, em média, 44 dias, segundo 13 entrevistas enviadas por usuários relacionadas a esse cargo. Para fins de comparação, o processo de contratação da empresa Meta em geral dura, em média, 43 dias.
De acordo com 13 entrevistas adicionadas ao Glassdoor, as etapas comuns do processo de entrevista do cargo de Software Engineer da empresa Meta incluem:
Entrevista individual: 35%
Teste de habilidades: 20%
Apresentação: 15%
Entrevista por telefone: 15%
Teste de personalidade: 5%
Entrevista por bancada em grupo: 5%
Verificação de antecedentes criminais: 5%
Confira os cargos mais buscados para contribuições de entrevistas:
Candidatei-me por meio de uma faculdade ou universidade. Fiz uma entrevista na empresa Meta.
Entrevista
Set up a technical interview. The interviewer was a bit flustered and couldn't figure out how to get audio to work on zoom for about 15 minutes. That being said, he gave me the extra time that was taken from those technical difficulties.
Perguntas de entrevista [1]
Pergunta 1
It was a typical coding question. Nothing too complicated
Fiz uma entrevista na empresa Meta (Londres, Inglaterra).
Entrevista
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.
Perguntas de entrevista [1]
Pergunta 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.
Perguntas de entrevista [1]
Pergunta 1
Move zeroes in an array to the end while keeping non-zero element order, in place