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.
J'ai postulé via un établissement d'enseignement supérieur ou universitaire. Le processus a pris 4 semaines. J'ai passé un entretien chez Meta en oct. 2010
Entretien
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).
Questions d'entretien [2]
Question 1
How to traverse a binary tree in order recursively.
J'ai postulé en ligne. J'ai passé un entretien chez Meta (Londres, Angleterre)
Entretien
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.
Questions d'entretien [1]
Question 1
First problem was a string problem and second involved using segtree to calculate points in a matrix.
J'ai postulé via la recommandation d'un employé. J'ai passé un entretien chez Meta en déc. 2021
Entretien
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.
Questions d'entretien [1]
Question 1
Given an array of integers nums and an integer k, return the total number of subarrays whose sum equals to k.