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 82% positive. To compare, the company-average is 74.1% positive. This is according to Glassdoor user ratings.
Candidates applying for Software Engineer roles take an average of 25 days to get hired, when considering 11 user submitted interviews for this role. To compare, the hiring process at Meta overall takes an average of 27 days.
Common stages of the interview process at Meta as a Software Engineer according to 11 Glassdoor interviews include:
Phone interview: 19%
Skills test: 15%
One on one interview: 15%
IQ intelligence test: 12%
Presentation: 12%
Personality test: 12%
Group panel interview: 8%
Other: 4%
Background check: 4%
Here are the most commonly searched roles for interview reports -
I applied through a recruiter. The process took 2 weeks. I interviewed at Meta in Apr 2015
Interview
Contacted by a technical recruiter, and did a short talk about the potential position I was interested. The technical recruiter is very nice and responsible. Then did a telephone interview by an engineer from Facebook. The engineer asked something like why I chose Facebook, and asked me to solve one problem.
Interview questions [1]
Question 1
For a binary tree, write an iterator class, which can in-order traverse the binary tree, implement two operations, next() and hasnext(). E.g., if in-order traversing a binary tree will return 2 3 4 5 6, then first call next(), it will return 2, call next() again, it will return 3, etc.
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