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. I interviewed at Meta
Interview
I got the interview from the campus recruitment was generally a positive experience. I was asked to code on a whiteboard in front of the interviewer after being asked about my interests . the questions were not too tough and the response was encouraging but I didnt make it . not sure why .
Interview questions [1]
Question 1
how to reverse print a single linked list and questions on different data structures and running time
I applied online. The process took 2 days. I interviewed at Meta (Menlo Park, CA) in Jan 2015
Interview
Two technical phone screen interviews and afterwards and invite to the Facebook University Day at a campus of my choice (Menlo Park, Seattle or NYC) - all expenses paid. On campus I had a final technical interview with one of the developers. The rest of the day was spent getting to know the campus and some of the newly hired developers as well as a Q&A with a senior developer.
Interview questions [1]
Question 1
Please tell me about a previous project of yours and what you would have to change in order to make it scale to millions of users.
The process took 3 months. I interviewed at Meta (Pittsburgh, PA) in Feb 2015
Interview
I had two coding phone interviews but did not move forward to the team matching interview.
For each round, a engineer first introduced himself ask a little bit about your experience. Then they go to coding questions directly. I perform good at first round but not that good at second round.
Interview questions [1]
Question 1
The coding questions are not that hard for both two rounds.
In the first round, the two questions are (1) return the sum of the k-largest digits ([0-9]) in the array (2) implement a LRU cache (least recently used)
In the second round, the two questions are (1) return the index of the largest element, if more than one element reaches max, pick one unifromly at random; (2) clone a graph. the graph is directed, unweighted and not necessarily fully connected.