Software Engineer applicants have rated the interview process at Meta with 3.3 out of 5 (where 5 is the highest level of difficulty) and assessed their interview experience as 56% positive. To compare, the company-average is 56.5% 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 2,263 user submitted interviews for this role. To compare, the hiring process at Meta overall takes an average of 31 days.
Common stages of the interview process at Meta as a Software Engineer according to 2,263 Glassdoor interviews include:
Phone interview: 39%
One on one interview: 24%
Skills test: 15%
Presentation: 8%
Background check: 4%
Group panel interview: 3%
Personality test: 3%
IQ intelligence test: 2%
Drug test: 1%
Other: 1%
Here are the most commonly searched roles for interview reports -
A recruiter set up a short chat and ask some behaviour questions, and bad things happen. She ask me some cliche questions like "why facebook" and I give my answer by talking about the technology fb using, which she didn't understand. I guess she expect me to be a fan of social network but my topic is always technology. Finally she ask if I am talking with other company. I give her a name of a company. But she never heard that. Hey, that's a middle size company in bay area just ipo 2yrs ago. She just can't understand what I am talking in the phone call. Not even one. Got rejection few days later.
Other Software Engineer Interview Reviews for Meta
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