Software Engineer applicants have rated the interview process at Meta with 3.4 out of 5 (where 5 is the highest level of difficulty) and assessed their interview experience as 65% positive. To compare, the company-average is 70.6% positive. This is according to Glassdoor user ratings.
Candidates applying for Software Engineer roles take an average of 27 days to get hired, when considering 53 user submitted interviews for this role. To compare, the hiring process at Meta overall takes an average of 28 days.
Common stages of the interview process at Meta as a Software Engineer according to 53 Glassdoor interviews include:
Phone interview: 33%
One on one interview: 20%
Skills test: 14%
Presentation: 12%
IQ intelligence test: 7%
Background check: 5%
Personality test: 4%
Group panel interview: 4%
Drug test: 2%
Here are the most commonly searched roles for interview reports -
I applied through an employee referral. The process took 4 weeks. I interviewed at Meta (Tel Aviv-Yafo) in Oct 2021
Interview
First of all, I had an interview(initial screening interview), I had two coding problems. After one day they send me a mail to step forward for the onsite interviews, they give me two weeks to prepare for them and they also send all the material that I have to review and questions to prepare. I had four onsite interviews, three are technical and the fourth is behavior. In the technical interviews, I also had two coding problems but they were challenging.
Interview questions [1]
Question 1
to prepare before applying I recommend solving leetcode problems and cards from Explore.
Generic LeetCode-style questions, many tagged as Meta, so extensive preparation is required to perform well in the technical interview. The experience varies significantly - some interviewers provide hints and guidance, while others expect candidates to solve problems independently with minimal assistance.
Spoke with interviewer over video conferencing. He was very communicative . He answered my questions. Asked me BFS question. A question that involved BFS search. Given a matrix, I am suppose to find a path from top left to down right.
Interview questions [1]
Question 1
A question that involved BFS search. Given a matrix, I am suppose to find a path from top left to down right.
The technical round hit me with a classic array manipulation problem: moving zeroes to the end without disrupting the order of non-zero elements. As I tackled it, I felt a wave of familiarity wash over me; I had just practiced a similar challenge on PracHub. The rest of the interview followed a straightforward path, with some easy behavioral questions sprinkled in. Overall, it felt very easy, but I wasn’t quite the right fit for what they needed, so I didn’t receive an offer.
Interview questions [1]
Question 1
Move zeroes in an array to the end while keeping non-zero element order, in place