Ho presentato la mia candidatura tramite segnalazione di un dipendente. Ho sostenuto un colloquio presso Meta nel mese di ott 2020
Colloquio
Two rounds of 45-mins coding and 5mins Q&A. After that, there would a team matching process. Hopefully, this would help. It was important to have an active conversation.
Domande di colloquio [1]
Domanda 1
Coding problems based on binary search, hashmap, and file reading.
Ho presentato la mia candidatura online. La procedura ha richiesto una settimana. Ho sostenuto un colloquio presso Meta nel mese di mar 2022
Colloquio
2 interviews back to back (each with a separate interviewer). Each interview had 2 medium-level coding questions. The first interviewer was so dismissive. Although I had the optimal solution idea, he didn't follow up at all. The other interviewer was way more involved and basically tried to get the best out of me.
Domande di colloquio [1]
Domanda 1
1) Get the highest k numbers in terms of their frequency. ===> Optimal solution is Quickselect I think
2) Find any local minimum in a given array. ===> Binary search
3) Stack problem
Ho presentato la mia candidatura tramite un selezionatore. Ho sostenuto un colloquio presso Meta nel mese di nov 2020
Colloquio
A recruiter reached out and set up a technical programming interview. They sent information about what types of questions etc. might be asked during the interview, which was nice. They also sent a link to CoderPad, the website they used to interview me. I practiced using the CoderPad free trial, and while I was practicing, I could test/run my code, so I was expecting to be able to run my code during the interview too. Unfortunately they don't allow you to run your code during the interview, so that threw me for a loop.
Make sure you're prepared for a blackboard-esque (i.e., no testing/running of code) interview, even if it's on a web interface.
Domande di colloquio [1]
Domanda 1
Generic problem solving technical interview questions (e.g., solve this graph question using recursion, how would you parse/edit this string with least data usage, etc.)
