Candidatei-me online. Fiz uma entrevista na empresa Meta.
Entrevista
After submitting my resume to Facebook I was contacted by one of their recruiters the next day. We talked on the phone about my work experience after which they asked me to give them three dates for which they can schedule my over the phone coding interview. They suggested to take at lest 2 weeks to prep for the interview for which they provided me with some training material. On the specified date one of the software engineers working at facebook called me to administer the interview. He introduced himself and asked me to tell him about the last project I worked on. This part lasted no more than 5 minutes, after which he asked me two coding questions. Upon finishing both of the question the interviewer gave me an opportunity to ask any question I might have had. I was told I will be contacted by the recruiter to let me know about further steps. I was contacted shortly via email but they decided not to proceed with the next interview. This came as a surprise since I answered both coding question correctly, unfortunately they were not willing to provide me with feedback to what was the reason of my rejection. Apart form not receiving any feedback, the interview process was very positive experience.
Perguntas de entrevista [1]
Pergunta 1
Given nested array calculate the depth sum and provide time and space complexity.
Input: [1, 2, [4, 5, [7], 8], 9]
Output: 1 + 2 + 2*(4 + 5 + 3*7 + 8) + 9 = 88
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