Intern Software Engineer applicants have rated the interview process at Meta with 3 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 74.2% positive. This is according to Glassdoor user ratings.
Here are the most commonly searched roles for interview reports -
I applied through college or university. The process took 4 weeks. I interviewed at Meta (Menlo Park, CA) in Oct 2013
Interview
The first one was an on-campus interview. It was 45 minutes long and consisted of 2 coding questions. The first one was checking if a string is palindrome the second one is to print out all the subsets.
The second round was two weeks later. It was a 45 minute phone interview. The question was to multiply two numbers that are represented in string.
My advice is that don't panic when you are given a hard question. I did not finish my last question and luckily still got the offer. Just try your best to show them how you approach the problem and be passionate and confidant!
Interview questions [1]
Question 1
check palindrome, print subsets, multiply numbers in string.
I applied through a recruiter. The process took 2 weeks. I interviewed at Meta in Nov 2013
Interview
I emailed the recruiter and requested an interview. My first round interview was on the phone a week or so later. I heard back 3 days later.
Interview questions [1]
Question 1
Program "atof", which means convert a string float (e.g. "345.44E-10") to an actual float without using any existing Parse Float functions. This is not hard but gets messy.
I applied through college or university. The process took 2 weeks. I interviewed at Meta
Interview
Met at campus career fair
Submitted resume
Invited to first round. A lot of chatting, then tech questions.
Invited to second round at HQ. Tech interview in the morning, then lunch, and A LOT more chatting, and getting to know Facebook.
Questions.
Round 1.
1. Function to check if 2 words are anagrams
2. Function to check if any 3 numbers sum to x.
Round 2.
You are given 2 streams of data, representing very sparse vectors
you are guaranteed that the 2 incoming streams are of same size
give a data structure which is optimized for producing the dot product of those sparse vectors
analyze your runtime/space complexity,
b) what if you are now told that v1, is much more sparse than v2
give another (or the same) data structure optimized for the dot product of any such 2 vectors (where 1 is more sparse than the other)
analyze your runtime/space complexity,
41
Top companies for "Compensation and Benefits" near you