Software Engineer applicants have rated the interview process at Meta with 3.5 out of 5 (where 5 is the highest level of difficulty) and assessed their interview experience as 62% positive. To compare, the company-average is 67.3% positive. This is according to Glassdoor user ratings.
Candidates applying for Software Engineer roles take an average of 44 days to get hired, when considering 13 user submitted interviews for this role. To compare, the hiring process at Meta overall takes an average of 43 days.
Common stages of the interview process at Meta as a Software Engineer according to 13 Glassdoor interviews include:
One on one interview: 35%
Skills test: 20%
Phone interview: 15%
Presentation: 15%
Background check: 5%
Group panel interview: 5%
Personality test: 5%
Here are the most commonly searched roles for interview reports -
I applied online. The process took 2 weeks. I interviewed at Meta in Oct 2016
Interview
Had one 45 minute phone interview with an engineer. The interviewer was very disinterested, wasn't paying attention to what I was doing and was loudly typing the entire time. It left a bad taste in my mouth. Now that I have had other interviews at big tech companies I see that this experience was an anomaly because other interviewers were engaged, pointing out bugs and asking questions, whereas my interviewer silently sat there the whole time. I'm extremely disappointed in the way I was treated
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