Envié una solicitud electrónica. El proceso duró 2 semanas. Acudí a una entrevista en Meta en nov 2021
Entrevista
This was a while back, but...
Phone interview was pretty bad.
Interviewer had poor audio quality, despite me letting him know a few times. It was done through some Verizon owned video call, and we used coderpad.
The technical portions was 1 LC hard and 1 LC medium, I'm not entirely sure how they expected us to finish both in 40 mins. No hints for the first LC hard-- and it was the first question. Was not able to finish it and struggled for a bit. The LC medium was fairly easy to do, though I probably messed up somewhere as I was being pressed for time.
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
Envié una solicitud electrónica. 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