I applied through college or university. The process took 1 day. I interviewed at Meta (Surathakal) in Aug 2011
Interview
I had to clear a online coding challenge. After that I had 4 rounds of this interview, one after the another on the same day. Most of the questions were technical in nature focusing on algorithms and problem solving. Other questions were based on my project and internships
I applied through a recruiter. The process took 2 weeks. I interviewed at Meta (Chicago, IL) in Nov 2012
Interview
I was participating in Facebook Midwest Regional Hackathon, and got contacted by the recruiter shortly thereafter at my university. We scheduled the first phone interview, which was a technical interview. The questions included printing binary search tree in reverse, finding k-th largest element in O(N) without modifying the node, and then same k-th largest element in log(N) time keeping the size of the subtree in each node.
Interview questions [1]
Question 1
"Reverse" of the problem if finding k-th smallest element in a tree: I had to find k-th largest.