Developer applicants have rated the interview process at Meta with 3.4 out of 5 (where 5 is the highest level of difficulty) and assessed their interview experience as 82% positive. To compare, the company-average is 74.1% positive. This is according to Glassdoor user ratings.
Candidates applying for Developer roles take an average of 25 days to get hired, when considering 11 user submitted interviews for this role. To compare, the hiring process at Meta overall takes an average of 27 days.
Common stages of the interview process at Meta as a Developer according to 11 Glassdoor interviews include:
Phone interview: 19%
Skills test: 15%
One on one interview: 15%
IQ intelligence test: 12%
Presentation: 12%
Personality test: 12%
Group panel interview: 8%
Other: 4%
Background check: 4%
Here are the most commonly searched roles for interview reports -
I applied online. The process took 1 day. I interviewed at Meta (New York, NY) in Feb 2022
Interview
The interview started with a recruiter call where we went over my resume. We talked about career goals and why I wanted to work at FB. The recruiter then asked questions regarding the time complexities of data structures.
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.