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 50% positive. To compare, the company-average is 59% positive. This is according to Glassdoor user ratings.
Candidates applying for Software Engineer roles take an average of 32 days to get hired, when considering 6 user submitted interviews for this role. To compare, the hiring process at Meta overall takes an average of 32 days.
Common stages of the interview process at Meta as a Software Engineer according to 6 Glassdoor interviews include:
Phone interview: 43%
One on one interview: 29%
Skills test: 29%
Here are the most commonly searched roles for interview reports -
I applied through college or university. The process took 2 weeks. I interviewed at Meta (Menlo Park, CA) in Sep 2022
Interview
There was a 90 minute take home coding interview, 45 minute tech screen, final round interview having 3 45 minute technical interviews and 1 45 minute behavioral. It was quite a long of work, however they were quick to schedule the next interview so the process didn't take more than a couple weeks in total.
Interview questions [1]
Question 1
They asked many leetcode medium questions, and had a portal with sample coding questions. The technical questions were easy to do if you did the ones in the portal as practice. (This was for the new grad interview process)
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