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 67% positive. To compare, the company-average is 58.2% positive. This is according to Glassdoor user ratings.
Candidates applying for Software Engineer roles take an average of 28 days to get hired, when considering 18 user submitted interviews for this role. To compare, the hiring process at Meta overall takes an average of 35 days.
Common stages of the interview process at Meta as a Software Engineer according to 18 Glassdoor interviews include:
Phone interview: 32%
Presentation: 18%
One on one interview: 14%
Skills test: 11%
Background check: 7%
Personality test: 7%
Group panel interview: 7%
IQ intelligence test: 4%
Here are the most commonly searched roles for interview reports -
I applied through an employee referral. The process took 4 weeks. I interviewed at Meta (Menlo Park, CA)
Interview
I'm interviewed as new grad. First, there was a phone interview. Then I was invited to attend facebook university day onsite interview. The difficulty is not high for new grad, but please review the questions you have solved before, and make sure you firmly remember the process of solving those issues. If a follow up question stops you, you could choose to back up and think the question as new question and cut the connection with previous thought.
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