Software Engineer applicants have rated the interview process at Meta with 3.2 out of 5 (where 5 is the highest level of difficulty) and assessed their interview experience as 53% positive. To compare, the company-average is 57.7% positive. This is according to Glassdoor user ratings.
Candidates applying for Software Engineer roles take an average of 57 days to get hired, when considering 19 user submitted interviews for this role. To compare, the hiring process at Meta overall takes an average of 39 days.
Common stages of the interview process at Meta as a Software Engineer according to 19 Glassdoor interviews include:
Phone interview: 39%
One on one interview: 24%
Skills test: 18%
Other: 3%
Presentation: 3%
Drug test: 3%
Personality test: 3%
Group panel interview: 3%
Background check: 3%
Here are the most commonly searched roles for interview reports -
I applied through a recruiter. The process took 3 weeks. I interviewed at Meta in Dec 2020
Interview
There is an initial call with an HR representative, followed by one phone-screen with an engineer. You are supposed to solve two 15-20 minute programming puzzles (though in my phone screen i was only asked to solve one somehow).
If you pass the phone screen - it is followed then by 3 additional programming interviews, each of which is of the same format (two 15-20 minute puzzles) and a behavioral interview.
Interview questions [1]
Question 1
Describe an implement an algorithm for finding a local minimum value in an array of numbers (a local minimum is a value where both neighbouring values are equal or larger).
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