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 50% positive. To compare, the company-average is 56.3% positive. This is according to Glassdoor user ratings.
Candidates applying for Software Engineer roles take an average of 39 days to get hired, when considering 10 user submitted interviews for this role. To compare, the hiring process at Meta overall takes an average of 46 days.
Common stages of the interview process at Meta as a Software Engineer according to 10 Glassdoor interviews include:
Phone interview: 36%
One on one interview: 21%
Presentation: 14%
IQ intelligence test: 7%
Skills test: 7%
Background check: 7%
Drug test: 7%
Here are the most commonly searched roles for interview reports -
I applied online. The process took 5 weeks. I interviewed at Meta (Menlo Park, CA) in Oct 2021
Interview
phone screen - 2 Medium LC
Final Round:
Technical Round 1 - 2 Medium LC
Technical Round 2 - 3 Medium LC
Behavioral Round - Honestly the most difficult of the rounds and clearly the round that they place the greatest emphasis on. This is the round that will ultimately decide if you get the job because there are countless applicants that can pass the technical rounds.
Interview questions [1]
Question 1
Implement Quickselect, implement level order traversal of binary tree
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