Ho presentato la mia candidatura tramite l'università. La procedura ha richiesto un giorno. Ho sostenuto un colloquio presso Meta nel mese di ott 2011
Colloquio
I had an on campus interview with a current software engineer. He first asked me to talk about some of the contents of my resume, and then asked me to elaborate on a recent project I worked on that I liked. He then asked me a few coding questions. Both went off of the same principle of trying to implement a method to process a certain type of regular expression. I coded on a whiteboard, and my interviewer gave feedback as I went along. At the end, he asked how I might optimize the method I wrote.
Domande di colloquio [1]
Domanda 1
How would you implement a method to tell whether or not a string matches a regex that consists of lower case letters and *s.
2 Rounds of standard leetcode questions and one behavioral round. Typical Meta questions were used and the last round had 2 coding questions followed by some behavioral and standard interview question time.
Ho presentato la mia candidatura online. Ho sostenuto un colloquio presso Meta (Londra, Inghilterra)
Colloquio
It was two coding challenges with an engineer. The interview was rescheduled a few times. The interviewer was nice and gave some clues to tackle the problem. After that there would be a cultural fit interview.
Domande di colloquio [1]
Domanda 1
First problem was a string problem and second involved using segtree to calculate points in a matrix.
Ho presentato la mia candidatura tramite segnalazione di un dipendente. Ho sostenuto un colloquio presso Meta nel mese di dic 2021
Colloquio
Got a Leetcode easy question about string manipulation, and then a medium sliding window question. I couldn't solve the second question even though the interviewer gave me hints, but I didn't have much time to prepare for the interview. He asked me to talk about big O complexity and write test cases at the end.
Domande di colloquio [1]
Domanda 1
Given an array of integers nums and an integer k, return the total number of subarrays whose sum equals to k.