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
Solicité el puesto a través de la escuela superior o la universidad. Acudí a una entrevista en Meta en oct 2017
Entrevista
Received a call from an engineer at Menlo Park and briefly discussed my experience. We then dived into the technical portion of the phone interview, and ended with me asking questions about the company.
Preguntas de entrevista [1]
Pregunta 1
Find the greatest integer less than n, such that it contains all of the digits in n. (i.e. n = 654, output would be 645)
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