Candidates applying for Software Engineer roles take an average of 7 days to get hired, when considering 2 user submitted interviews for this role. To compare, the hiring process at Meta overall takes an average of 42 days.
Common stages of the interview process at Meta as a Software Engineer according to 2 Glassdoor interviews include:
Phone interview: 67%
Skills test: 33%
Here are the most commonly searched roles for interview reports -
I applied through a recruiter. The process took 2 weeks. I interviewed at Meta (Seattle, WA) in Jul 2016
Interview
Was contacted by interviewer on LinkedIn. Since I live in Seattle, I was called onsite for 45 min preliminary round. HR received me and gave office tour. Then, I was introduced to interviewer. Interviewer was young and energetic . Interviewer asked me a question around binary tree and I was able to answer the question and write code quickly. Next day I was contacted by recruiter saying that they want to scheduled another interview before calling me onsite. This time I asked for phone interview. Second interviewer asked another question related to trees. I was able solve the problem and write code in 40 min. Later HR contacted me and said Interviewers are not happy with me. I'm not sure what they were expecting. HR said they couldn't tell me the reason for rejection due to legal reasons. It seems like they just want young engineers who can just code.
Interview questions [1]
Question 1
Questions around BinaryTree and BinaryServiceTrees
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