I applied online. I interviewed at Meta (Menlo Park, CA) in Jan 2017
Interview
Normal standard process. The interview process was similar to other ones in the Silicon Valley. Phone Screen. On-campus interview and then a final interview round.
I applied online. I interviewed at Meta (Menlo Park, CA) in Jul 2017
Interview
I applied through a recruiter. I interviewed at Facebook (Menlo Park, CA) in July 2017.
I was contacted by a recruiter via email and he then called me up to get to know about my background and experience and then he scheduled a phone interview with one of the Facebook Engineers. The initial phone screen was pretty straightforward and not that difficult, so I was able to solve all the problems. I received an email from the recruiter the very next day for a quick chat over the phone and there I was told that they would like to continue with this process and a second phone interview was scheduled.
The second phone interview was easy as well and I was able to solve the problem pretty quickly. And like before I was contacted by the recruiter almost immediately and he scheduled an on-site interview for me at Menlo Park,CA. The on-site interviewes were very intense. The questions were tough but luckily the interviewers at FB are very friendly and they try to help you out as much as they can. They actually want you to succeed. I underestimated the system design round and that was my BIGGEST mistake. But all in all, the whole experience was amazing. I have been to a lot of interviews before but the way Facebook conducts the interviews is just awesome.
Interview questions [1]
Question 1
PI - 1:
i.) Reverse a Linked List?
ii.) Divide 2 numbers without using "/" symbol and return remainder and the quotient?
PI - 2:
i.) Merge Intervals (Leet Code)
OS:
i.) Behavioural: Why FB? Followed by a coding challenge: Minimal run time scheduler(Leet Code)
ii.) CC: Expression Evaluation
iii.) CC: Find the K closest points to the origin in 2D plane, given an array containing N points. You can assume K is much smaller than N and N is very large.
Referred by someone at New York headquarter. Phone interview at the first round. Need to code and run online judge after the code has been completed. Have not heard from the feedback yet after 1 day.
Interview questions [1]
Question 1
Return the sum of node values at each level of binary tree