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 persona. El proceso tomó 2 semanas. Acudí a una entrevista en Meta
Entrevista
It was very comfortable experience. The interviewer was friendly, seemed genuinely interested in answering the questions and was in all very resourceful. Definitely recommend brushing up your favorite language as Facebook expects code that runs correctly at the end of the interview even though the interviewer may or may not ask you to run it. Still awaiting decision ...
Preguntas de entrevista [1]
Pregunta 1
1 coding question regarding binary trees- check if its a binary tree
1 recursion question
1 leetcode med, 1 leetcode hard. make sure you know your DSA and leetcode questions. I wasn't able to get an offer bc i didnt complete the second question. Got a reply 2 days later saying they would move on