Candidatei-me por indicação de um funcionário. O processo levou 3 meses. Fui entrevistado pela Meta (New York, NY) em set. de 2019
Entrevista
I was approached by a recruiter, but she didn't get back to my reply. I later went through employee referral.
I had one phone interview and (although I believed I was good), the interviewer was not confident in advancing me to the next round. I had another follow up phone interview and then advanced to the on site interviews. The results of the on site interviews had some mixed signals in the coding section and I went for a follow up on site coding interview. I received the feedback in one week after the final interview.
My recruiter was very open and communicated every step clearly. I was amazed by how he skillfully managed my process and was ready to help. The whole process was very smooth and I had a very good experience talking to the interviewers and the rest of the team.
Perguntas de entrevista [1]
Pergunta 1
The coding questions are on average mid level questions. They are not tricky and they are fairly straightforward. Yet, it seems important that you need to solve the coding questions completely to the end, find the optimal solution and cover all the edge cases carefully. For my case, I solved two coding questions in each of the 45 minute coding interviews. The behavioral, system design and machine learning questions were straightforward and manageable.
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