Candidatei-me por meio de recrutador(a). Fiz uma entrevista na empresa Meta (Menlo Park, CA).
Entrevista
Did a phone screen with them. The interviewer gave me a task which I already knew the solution for at first (find two elements in an integer array which sum up to a given number). When I pointed out that I know the solution to the problem, he gave me another one: to determine if a sequence of numbers is monotonic (i.e. ascending or non-descending). The interviewer didn't seem to understand the difference between non-decreasing and ascending sequences and it took a while to figure out the exact specification for the problem. The interviewer expected a straightforward solution which compares elements pairwise, but I came up with a more elegant one, which is based on calculating the pairwise difference and would require only a single array traversal. The interviewer didn't understand my solution and told me that he haven't seen this solution before and it wasn't the solution he was excepting. Eventually, he couldn't come up with an example where my code wouldn't work or a flaw in my reasoning.
I've got feedback that my solution wasn't the one the interview was expecting and therefore rejected.
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.
Perguntas de entrevista [1]
Pergunta 1
Move zeroes in an array to the end while keeping non-zero element order, in place
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