I applied through a staffing agency. The process took 5 days. I interviewed at Meta (Menlo Park, CA) in May 2015
Interview
Phone Screen 45 min duration in total, the interviewer said a little bit about himself and went straight to a technical question. No background questions. The interview process went as expected, no surprises. The interviewer seemed to be a nice guy.
Interview questions [1]
Question 1
Given a sequence of numbers (34128) and an input map such as a dial pad on a phone (2->[a,b,c], 3->[d,e,f], 4->[g,h,i]) write an algorithm to return all possible words from the sequence.
E.g. Input: 232
Output: [ada, adb, adc, aea, aeb, aec, afa, afb, afc, bda, bdb, bdc, bea, beb, bec, bfa, bfb, bfc, cda, cdb, cdc, cea, ceb, cec, cfa, cfb, cfc]
I applied through an employee referral. The process took 1 day. I interviewed at Meta in Mar 2015
Interview
The interview was a phone screen; the first 10-15 minutes asked me about my research, and then I had to code a palindrome detection algorithm. I answered the question eventually, but I had a couple of bugs while writing and this did not seem to please the interviewer, who wanted to ask follow-up questions.
Interview questions [1]
Question 1
Palindrome detection with non-alphanumeric characters
I applied online. The process took 4 weeks. I interviewed at Meta in Apr 2015
Interview
I had applied online for a summer internship. Recruiter reached out to me and scheduled phone interview. I got through first round phone interview. Second round was also phone interview. It went pretty well but I did not get an offer. Interviewers asked some basic questions about my background, projects etc. Then they spoke a bit about their background. Interviewers are friendly and helpful.
Interview questions [2]
Question 1
Given an array of integers, find three integers a, b and c such that a+b+c=0.
Modification: If the array is given in sorted order, can you do it without O(n) space?
Given a large input string, write a function to check if it is a palindrome, according to the following restrictions:
-lowercase and uppercase characters are considered equal
-special characters are ignored