Software Developer applicants have rated the interview process at Meta with 4 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 74.2% positive. This is according to Glassdoor user ratings.
Candidates applying for Software Developer roles take an average of 14 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 43 days.
Common stages of the interview process at Meta as a Software Developer according to 3 Glassdoor interviews include:
One on one interview: 50%
Skills test: 50%
Here are the most commonly searched roles for interview reports -
The whole process took 3 months. My interviews were rescheduled twice and prolonged the process by 1 month. Consists of the typical leet code, system design, and behavioral interviews. Leet code questions are from Leet code top Meta questions, with slight alterations.
I applied through an employee referral. The process took 4 weeks. I interviewed at Meta (New York, NY) in Nov 2024
Interview
Initial recruitement screen to gauge logistics and lightly peruse your background and interest.
First Technical round comprised of two leetcode medium difficulty problems under a time constraint of roughly 40 minutes for both. The interviewers may give hints to guide you, but too many hints might signal that you’re not meeting expectations.
Preparation Tips:
Familiarize yourself with the LeetCode 75 or 150 problems, focusing on medium-to-hard difficulty.
Practice coding in a pressure environment and explaining your approach as you go.
I didn't make it past the intial technical but here's an overview:
Q1 Focus: Optimization skills and problem-solving efficiency.
Q2 Focus: Ability to design and utilize custom data structures while demonstrating a deep understanding of algorithm complexity and performance trade-offs.
Interview questions [1]
Question 1
Array Problem to assess medium difficulty Algo knowledge:
The problem involves testing whether you can optimize an
𝑂(𝑛^2) time complexity algorithm into an 𝑂(𝑛) solution. This typically requires identifying a more efficient approach, such as using hash maps, sliding windows, or prefix sums, depending on the context.
2 technical rounds with 2 leetcode medium + hard problems. The interviewers were friendly. Answered all questions with optimal solutions. Then there is a behavioral round with standard behavioral questions by a meta engineer / manager.