Candidatei-me por meio de recrutador(a). O processo levou 3 semanas. Fui entrevistado pela Meta (Dublin, Dublin) em mar. de 2017
Entrevista
first, an initial interview process with two engineers, asking about how to improve complexity of some simple algorithms. A second interview in site with more complex questions and review all my previous positions. Had to prepare a tech presentation for 4 engineers.
Perguntas de entrevista [1]
Pergunta 1
Calculate the maximum subarray sum based on non adjacent elements. explaining complexity.
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
Candidatei-me online. Fiz uma entrevista na empresa Meta (Menlo Park, CA).
Entrevista
It's honestly striaght from leetcode tagged
There are no surprises if you do tagged you would be good and do well.
System design is much harder. Would recommend using hello interview.
Perguntas de entrevista [1]
Pergunta 1
Design Twitter and consider if it was suddenly an extremely low latency env