Software Engineer applicants have rated the interview process at Meta with 4 out of 5 (where 5 is the highest level of difficulty) and assessed their interview experience as 100% positive. To compare, the company-average is 58.1% positive. This is according to Glassdoor user ratings.
Candidates applying for Software Engineer roles take an average of 14 days to get hired, when considering 1 user submitted interviews for this role. To compare, the hiring process at Meta overall takes an average of 37 days.
Common stages of the interview process at Meta as a Software Engineer according to 1 Glassdoor interviews include:
Presentation: 20%
Personality test: 20%
One on one interview: 20%
Skills test: 20%
Group panel interview: 20%
Here are the most commonly searched roles for interview reports -
I applied through a recruiter. I interviewed at Meta in Mar 2018
Interview
Phone screen, everything was all usual. First answered the question with LinkedList approach, interviewer says yes works but LL uses extra memory to save pointer so i revised my logic to use array with a circular queue mechanism. Interviewer was pleased (i assumed it wrong). 2 days after phone screen, got the dreaded email.
This was my second phone screen in 2 years at FB, one thing is for sure you need to give the best solution in one shot, no going back and forth. They hire bots who knows 1000+ question on fingertips from leetcode./topcoder/blah blah...
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