El proceso tomó 1 semana. Acudí a una entrevista en Meta (West Lafayette, IN) en sep 2017
Entrevista
Contacted by Facebook after dropping resume to them at campus recruitment. The interviewer was helpful. Facebook was quick in responding and overall was a great experience. Two rounds of interviews: first was no campus and the second on-site. They filtered people after the on campus interviews and only invited some on-site.
Preguntas de entrevista [2]
Pregunta 1
Given a binary tree containing integer data and an integer S, find a path from root to node who's data values add up to S.
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.
Preguntas de entrevista [1]
Pregunta 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.
Preguntas de entrevista [1]
Pregunta 1
Move zeroes in an array to the end while keeping non-zero element order, in place
Me postulé en línea. Acudí a una entrevista en 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.
Preguntas de entrevista [1]
Pregunta 1
Design Twitter and consider if it was suddenly an extremely low latency env