Ho presentato la mia candidatura online. La procedura ha richiesto 3 settimane. Ho sostenuto un colloquio presso Meta (Los Angeles, CA) nel mese di ott 2019
Colloquio
I submitted my application online and got an email from a recruiter a couple weeks later. I attended a social event Facebook held at my university and got to know the interviewers. The following week I had an in person interview at my university's campus. I spoke with one interviewer and wrote code on a white board. A couple weeks after I had another technical interview over video chat.
Domande di colloquio [1]
Domanda 1
Write code to add two very large integers together (given as strings). Now add on to that code to add two very large integers with decimal points. Write an algorithm to find the diameter of a binary tree.
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.
