Ho presentato la mia candidatura tramite l'università. La procedura ha richiesto 4 settimane. Ho sostenuto un colloquio presso Meta nel mese di ott 2010
Colloquio
My interviewer was very nice and seemed like a chill guy. He asked me to talk about what I did in the past and to name a cool coding project that I did in the past for fun. He asked me how to traverse a binary tree in order. I first solved it recursively, and then he asked for the iterative solution (no parent pointers allowed).
Domande di colloquio [2]
Domanda 1
How to traverse a binary tree in order recursively.
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.
