Software Engineer applicants have rated the interview process at Meta with 3.5 out of 5 (where 5 is the highest level of difficulty) and assessed their interview experience as 38% positive. To compare, the company-average is 58% positive. This is according to Glassdoor user ratings.
Candidates applying for Software Engineer roles take an average of 26 days to get hired, when considering 8 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 8 Glassdoor interviews include:
Phone interview: 38%
One on one interview: 25%
Skills test: 25%
Group panel interview: 13%
Here are the most commonly searched roles for interview reports -
I applied online. The process took 1 day. I interviewed at Meta (Palo Alto, CA) in Jan 2017
Interview
Went for an in-person tech screen. Was a 45-minute session with an engineer in a meeting room with a whiteboard. I was given a pretty tough question, and didn't do a stellar job at answering, but I also didn't have any professional experience with C++, which he said was their primary language, so I guess it's understandable that they passed on me.
Interview questions [1]
Question 1
Given a list of denominations (e.g., [ 1, 2, 5 ] means you have coins worth $1, $2, and $5) and a number k, find all possible combinations, if any, of coins in the given denominations that add up to k, including repeats.
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