Me postulé a través de una facultad o universidad. El proceso tomó 4 semanas. Acudí a una entrevista en Meta (Menlo Park, CA) en oct 2018
Entrevista
Gave my resume to a recruiter on campus and setup a phone interview. The interview was straight forward efficient string lookup from array of strings (the type of questions that are solved using a trie).
Thought I bombed the phone screening but got invited to an onsite. Onsite consisted of 2 technical interviews and a behavioral interview with a technical question at the end.
Preguntas de entrevista [1]
Pregunta 1
Several tree questions. E.g. how to check if two BSTs have the same number of elements (linear time, constant space).
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