Intern applicants have rated the interview process at Meta with 3.5 out of 5 (where 5 is the highest level of difficulty) and assessed their interview experience as 100% positive. To compare, the company-average is 59% positive. This is according to Glassdoor user ratings.
Here are the most commonly searched roles for interview reports -
I applied in-person. The process took 1 week. I interviewed at Meta (Palo Alto, CA) in May 2010
Interview
I was referred to the position from a previous interview at another company. They were looking to fill the position relatively quickly. I had a phone interview with two people in the department, then had in person interview with three people in the department.
Interview questions [1]
Question 1
I was asked my opinion of NPS, or Net Promoter Score. I was not familiar with the metric at the time, which made it a more difficult question to answer.
I applied online. The process took 4 days. I interviewed at Meta in Sep 2013
Interview
I applied online and my school had their own internship application program but they decided not to use that. Instead, the HR called me and asked me some typical HR questions, which I was able to answer, and then she scheduled me with a manager for further evaluation. She also told me there would be 2 rounds of tech interviews which I thought was weird of an internship..
Interview questions [1]
Question 1
So dev manager was asking about algorithms and I was able to answer most of them. But then he asked something about NP completeness which I had no clue what it was about.
I applied through an employee referral. The process took 2 weeks. I interviewed at Meta in Aug 2013
Interview
The second time I apply, and the second time I fail in the second interview.
Awesome process.
awesome and very quick: 2 interviews.
interview one:
Q1)Write a function that takes a list of words as input, and returns a list of groups of those words which are anagrams. Groups should not contain duplicates. Two words are anagrams if you can turn one into the other by just rearranging the letters.
Example:
Input: ["star", "rats", "star", "car", "arc", "arts"]
Output: [["star", "rats", "arts"], ["car", "arc"]]
Q2) Write a function that, given n integer intervals [a_i, b_i] on the real axes, where the absolute value of the coordinates is bounded by M, returns a point that belongs to the maximum number of intervals. Point x belongs to the interval [a, b] iff a <= x <= b.
Example:
intervals: [-4, -1] [3, 5] [-5, -3] [-2, 3]
output: 3
(I soleve it in a bad way then asked for a hing to optimize)
Interview two:
Q1: Given two arrays, find common elements Then question about hash table
Interview questions [1]
Question 1
Not really difficult, but i forgot to use dynamic programming.(even they ask me to prepare it and I prepare it but not enough)
You are in #, how to go to W
W
=================
|0|5|0|5|0|1|0|4|
|0|0|0|2|0|0|0|0|
|0|1|0|0|2|2|0|1|
|0|0|0|0|2|0|0|1|
|9|0|0|0|2|7|0|0| H
|9|0|9|0|0|0|0|0|
|9|0|0|5|0|0|0|0|
|9|0|0|#|0|0|0|0|