I applied through a recruiter. I interviewed at Meta (Menlo Park, CA)
Interview
I was contacted by a recruiter on LinkedIn. The time between indicating to the recruiter that I was interested to the date of the final set of onsite interviews was about 1 month.
I'm local to Facebook HQ, so for the initial screening interview I was given the option to do it over the phone or onsite (I chose the latter). The interviewer asked me about my recent work history, and asked me to solve a couple of coding problems.
I returned a couple of weeks later for 5 onsite interviews, which consisted of 2 coding, 2 design, and 1 fit interview. Most of the interviews were good experiences, except for one where I unfortunately got stuck on a problem and the interviewer just sat there watching me while I struggled.
I applied online. The process took 3 days. I interviewed at Meta (New York, NY) in Jan 2011
Interview
HR phone interview, in-house coding interview. ull-time software candidates in USA. Submitted resume at college career fair. Got email about on-campus interviews. At this stage, there are 3 possible outcomes: onsite invitation, a phone interview for an additional chance, or reject. I was invited to onsite interview.
Onsite was a "University Day" that included three interviews (not four like they said in the email) before lunch and then a tour, new-hire panel, etc after lunch.
Interview questions [1]
Question 1
Given n points on a 2D plane, find the maximum number of points that lie on the same straight line.
I applied through college or university. The process took 2 days. I interviewed at Meta (Houston, TX) in Feb 2015
Interview
Face to face 45min interview. After briefly asking some questions about your background on your resume, the interviewer gives 1 algorithm problem and 1 follow up regarding to how you solve this problem.
Question:
Give a dictionary with a huge set of words and a string with wildcard. You are required to find whether there is a match in the dictionary for this given string.
Interview questions [1]
Question 1
Give a dictionary with a huge set of words and a string with wildcard. You are required to find whether there is a match in the dictionary for this given string.