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 -
The process took 2 days. I interviewed at Meta in Oct 2011
Interview
Every single interview was exactly the same format: the interviewer gives me two or three programming problems and asked me to solve them in my language of choice in front of him on a whiteboard (or virtual whiteboard
Interview questions [1]
Question 1
FInd the maximum sum of a sub-sequence from an positive integer array where any two numbers of sub-sequence are not adjacent to each other in the original sequence. E.g 1 2 3 4 5 6 --> 2 4 6
The process took 4 weeks. I interviewed at Meta in Oct 2011
Interview
First, a group of Facebook employees came to my campus to conduct on campus interview. There were 2 rounds of on campus interview - you had to pass the first round in order to get to the second. After the 2 rounds, you should be notified whether or not you receive the job. However, they asked me to complete a third and final phone interview. It took several weeks to schedule, but finally I had the phone interview.
In the first interviews, I was only asked coding questions. The third was more behavioral, but we ended with a coding question.
Interview questions [4]
Question 1
Given a tree, print the values contained at each level on the same line.
So if you had the tree with root A, and children B and C, you would print:
A
B C
Find the min and max in an array. Now do it in less than 2n comparisons. (they were looking for the solution that finds both max and min in about 3/2 n comparisons).
Compute the square root of a number down to a certain precision.
ie sqrt(num, precision) returns a number that is in-between sqrt(num) - precision and sqrt(num) + precision.
I applied through a recruiter. The process took 1 day. I interviewed at Meta in Oct 2011
Interview
Hr contacted me and gave a timed skill test, through interviewstreet. I didn't like to code in that website nor coding a timed test. basically they don't know how long its going to take and they give very less time.They don't tell that u can pause or come again etc.. in my opinion FB is over hyped good place to work move on to other good companies ;)
Interview questions [1]
Question 1
given a list of words with a same size and a big string that contains one of the permutation of all the words combined(say p), find the startindex of the string p in the big string