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 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 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 -
Pretty straightforward interview process - screener interview followed by a 4 interview loop. Facebook uses the loop to do two standard algorithms/data structures technical interviews, one manager/fit interview and one "design" interview which I misunderstood to mean user facing design, but instead is more of an architecture, big box drawing exercise.
Interview questions [1]
Question 1
Asked to design a system for facebook chat messaging. Difficult since I hadn't had any backend/distributed systems experience.
I applied through an employee referral. I interviewed at Meta (New York, NY) in Apr 2013
Interview
I came onsite for what was described as an hour-long introductory and technical interview. I was greeted by the recruiter and shown around the office (FB NYC), then we chatted for 10-15 minutes. Then an engineer came in and we started the technical part of the interview, which took 45+ minutes (we ran over).
First he asked me about Hadoop, since I mentioned that I used it at my current job. I used hadoop for machine learning tasks, so we discussed the details of the system.
The rest of the interview was coding on a whiteboard. The questions got progressively more difficult.
The first was: Given two string representations of binary numbers (e.g. "1001", "10") write a function that adds them and returns the result as a string as well (e.g. "1011").
The next had several parts:
(a) first, write a function to calculate the hamming distance between two binary numbers
(b) write a function that takes a list of binary numbers and returns the sum of the hamming distances for each pair
(c) the answer I gave for b was O(n^2), I was then tasked with finding a more efficient solution. I struggled mightily, and was eventually helped to the solution by many hints from the interviewer.
After that, I had a chance to ask questions of the interviewer, and then we were done. I don't know if I've made it to the next round or not.
Interview questions [1]
Question 1
(a) first, write a function to calculate the hamming distance between two binary numbers
(b) write a function that takes a list of binary numbers and returns the sum of the hamming distances for each pair
(c) find a solution for (b) that works in O(n) time.