Ho presentato la mia candidatura tramite l'università. La procedura ha richiesto una settimana. Ho sostenuto un colloquio presso Meta nel mese di nov 2014
Colloquio
I had a first-round in-person interview at my university where I was being interviewed along with many other candidate interns. The questions were not too difficult at all, the first one was basically to implement binary search and the second one had to do with array manipulation. I answered the questions correctly but still didn't advance so I'm not totally sure what they were looking for.
Domande di colloquio [1]
Domanda 1
Given an array, move all the zeros to the end and return the number of nonzero elements in the array
Ho presentato la mia candidatura online. La procedura ha richiesto 3 mesi. Ho sostenuto un colloquio presso Meta (Washington, DC) nel mese di set 2024
Colloquio
1. OA
hr call and help you schedule your interviews
2. coding interview(2 medium questions)
3. coding interview(2 medium questions)
4. behavior interview
hr will connect you to tell you result
2-4 were in one day
Domande di colloquio [1]
Domanda 1
"Tell me about yourself."
"What are your greatest strengths?"
"What are your weaknesses?"
Ho presentato la mia candidatura tramite un selezionatore. La procedura ha richiesto 2 giorni. Ho sostenuto un colloquio presso Meta
Colloquio
It's a large company, but interviewing was definitely a more robotic process. The technical interviewer seemed checked out and didn't explain interview process well. At the end of the interview the interviewer only talked about himself, so I figured I wasn't in the running anymore.
Ho presentato la mia candidatura tramite segnalazione di un dipendente. La procedura ha richiesto una settimana. Ho sostenuto un colloquio presso Meta (Vancouver, BC) nel mese di gen 2022
Colloquio
The interview was okay and I solved two questions but didn’t pass the first round, hard to tell and didn’t get the feedback why I was failed. Probably they don’t have headcount?
Domande di colloquio [1]
Domanda 1
Two questions from leetcode, one is the tree and another one is the top k number.
