Software Engineer applicants have rated the interview process at Meta with 3.3 out of 5 (where 5 is the highest level of difficulty) and assessed their interview experience as 56% positive. To compare, the company-average is 56.6% positive. This is according to Glassdoor user ratings.
Candidates applying for Software Engineer roles take an average of 27 days to get hired, when considering 2,263 user submitted interviews for this role. To compare, the hiring process at Meta overall takes an average of 31 days.
Common stages of the interview process at Meta as a Software Engineer according to 2,263 Glassdoor interviews include:
Phone interview: 39%
One on one interview: 24%
Skills test: 15%
Presentation: 8%
Background check: 4%
Group panel interview: 3%
Personality test: 3%
IQ intelligence test: 2%
Drug test: 1%
Other: 1%
Here are the most commonly searched roles for interview reports -
I applied online. The process took 2 weeks. I interviewed at Meta in Mar 2022
Interview
Letter -> HR call -> Coding Interview -> System Design and stuff.
A lot of letters and notifications, a platform for preparing for the interviews and other cool stuff; hiring process is on the next technical level when compared to my other experiences.
The saddest thing is that you have no detailed feedback; it is either "everything is good, we're keeping moving" or "sorry to tell you you're not a fit". When I asked specifically to provide a somewhat detailed feedback on what went right and wrong on Coding Interview, I got an "NDA" answer or a close one. So it does seem to me that though I did solve the problems suggested I somehow didn't fit.
Interview questions [1]
Question 1
1. "Write a code telling wether a string is a valid number". Some basic examples are given, but you can dig in by giving your own examples of complex bad and good cases, like: "- .5" or "001", etc. Mostly depends on your fantasy
2. "Given a binary tree with unique values in nodes, for a query of two different nodes find the lowest common ancestor in this tree". Given the tree == given the root. A tree is a DAG, so no back edges from children to parent presented (but you are supposed to think of it and ask things like that, I presume)
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