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 56% positive. To compare, the company-average is 56.5% positive. This is according to Glassdoor user ratings.
Candidates applying for Software Engineer roles take an average of 27 days to get hired, when considering 2,262 user submitted interviews for this role. To compare, the hiring process at Meta overall takes an average of 31 days.
Common stages of the interview process at Meta as a Software Engineer according to 2,262 Glassdoor interviews include:
Phone interview: 39%
One on one interview: 24%
Skills test: 15%
Presentation: 8%
Background check: 4%
Personality test: 3%
Group panel interview: 3%
IQ intelligence test: 2%
Drug test: 1%
Other: 1%
Here are the most commonly searched roles for interview reports -
I applied online. The process took 1 week. I interviewed at Meta in Apr 2018
Interview
I am excited about interview process. Interviewer was very friendly and helps me to understand hiring process a lot. First general HR manager have contacted me, tell about the company and role of the SW engineer, then asked to tell about myself to see "soft skills" - ability to communicate and check how I act in different situations at work. Then we agreed about technical interview. Tech interviewer checks programming skills.
Interview questions [1]
Question 1
General programmer skills, algorithms, data structures and system design. You can find set of question in the book "Cracking coding interview"
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