Software Developer 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 Developer 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 Developer according to 18 Glassdoor interviews include:
Phone interview: 32%
Presentation: 18%
One on one interview: 14%
Skills test: 11%
Personality test: 7%
Group panel interview: 7%
Background check: 7%
IQ intelligence test: 4%
Here are the most commonly searched roles for interview reports -
I applied through an employee referral. The process took 2 weeks. I interviewed at Meta
Interview
1 interview 2 question through blue jeans. I think I answer 2 question correctly but I was rejected anyway. The first question is about convert binary number to integer. the second question is about symmetrical string. Leetcode is helpful.
I applied through a recruiter. I interviewed at Meta
Interview
Had an initial recuriter call and then scheduled a coding round with 2 leetcode questions. Practicing Meta-tagged leetcode questions would help prepare for this round. Interviewers expect clear communication and code.
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.