I applied through a recruiter. I interviewed at Meta (Palo Alto, CA) in Feb 2017
Interview
I was contacted by a recruiter and was set up with a phone interview the following week. They asked me a binary tree question and I honestly didn't know how to go about the question at that time. One thing to note is that Facebook moves really fast.
Interview questions [1]
Question 1
Given postorder and inorder traversals, construct a binary tree.
Spoke with interviewer over video conferencing. He was very communicative . He answered my questions. Asked me BFS question. A question that involved BFS search. Given a matrix, I am suppose to find a path from top left to down right.
Interview questions [1]
Question 1
A question that involved BFS search. Given a matrix, I am suppose to find a path from top left to down right.
The technical round hit me with a classic array manipulation problem: moving zeroes to the end without disrupting the order of non-zero elements. As I tackled it, I felt a wave of familiarity wash over me; I had just practiced a similar challenge on PracHub. The rest of the interview followed a straightforward path, with some easy behavioral questions sprinkled in. Overall, it felt very easy, but I wasn’t quite the right fit for what they needed, so I didn’t receive an offer.
Interview questions [1]
Question 1
Move zeroes in an array to the end while keeping non-zero element order, in place
I applied online. I interviewed at Meta (Menlo Park, CA)
Interview
It's honestly striaght from leetcode tagged
There are no surprises if you do tagged you would be good and do well.
System design is much harder. Would recommend using hello interview.
Interview questions [1]
Question 1
Design Twitter and consider if it was suddenly an extremely low latency env