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 43% positive. To compare, the company-average is 55.6% positive. This is according to Glassdoor user ratings.
Candidates applying for Software Engineer roles take an average of 39 days to get hired, when considering 21 user submitted interviews for this role. To compare, the hiring process at Meta overall takes an average of 42 days.
Common stages of the interview process at Meta as a Software Engineer according to 21 Glassdoor interviews include:
Phone interview: 25%
One on one interview: 22%
Skills test: 13%
Presentation: 9%
Group panel interview: 9%
IQ intelligence test: 6%
Other: 6%
Personality test: 6%
Background check: 3%
Here are the most commonly searched roles for interview reports -
I applied through an employee referral. The process took 2 months. I interviewed at Meta (London, England) in Jul 2018
Interview
I got an email for the recruiter, then after 2 weeks I had a phone interview, and then after a month I went to London on 5 interviews. First was behavioral, next 2 were coding questions and the last 2 were system design.
Interview questions [1]
Question 1
Phone:
1. 2-SUM in sorted array
2. Check if binary tree is BST
Onsite coding:
1. Remove invalid parentheses
2. Leetcode: Walls and Gates
3. Leetcode: Flatten Nested List Iterator
System design:
1. Design Instagram
2. Design a Facebook plugin to show most-listened songs on user profile
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