Software Engineer applicants have rated the interview process at Meta with 3 out of 5 (where 5 is the highest level of difficulty) and assessed their interview experience as 33% 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 21 days to get hired, when considering 3 user submitted interviews for this role. To compare, the hiring process at Meta overall takes an average of 29 days.
Common stages of the interview process at Meta as a Software Engineer according to 3 Glassdoor interviews include:
Phone interview: 67%
Presentation: 33%
Here are the most commonly searched roles for interview reports -
I applied through a recruiter. The process took 3 weeks. I interviewed at Meta (San Francisco, CA) in Oct 2017
Interview
Contacted by recruiter over Linkedin.
Passed between 3 different recruiters.
Did phone screen.
Did 5 hours of onsite interviews.
Got no feedback from recruiter.
Emailed recruiter twice over several days before receiving reply.
Recruiter replies that they want to do another 45 min interview.
Set up time for a call with recruiter to schedule & discuss process.
At this point I've never met recruiter because I was greeter for onsite by yet a different recruiter.
Recruiter did not call at designated time or follow up over email.
Had to email recruiter.
I gave up.
Already wasn't willing to do another interview.
How can your process be so broken that you can't decide yes or no after 6 hours of interviews?
If you need another interview its a no.
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