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.5% 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,262 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,262 Glassdoor interviews include:
Phone interview: 39%
One on one interview: 24%
Skills test: 15%
Presentation: 8%
Background check: 4%
Personality test: 3%
Group panel interview: 3%
IQ intelligence test: 2%
Drug test: 1%
Other: 1%
Here are the most commonly searched roles for interview reports -
I applied through college or university. The process took 3 weeks. I interviewed at Meta in Oct 2018
Interview
I submitted my resume in a career fair at my school. In a month, HR emailed me for scheduling a phone interview. Maybe it is because this is my first phone technical interview, so I got cold feet and I cannot even think the answer to an easy question. It feels awful.
Interview questions [1]
Question 1
Given two strings, write a boolean function to determine whether the first string is the anagram substring of the second one.
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