I applied through an employee referral. The process took 2 months. I interviewed at Meta
Interview
I got a chance of phone interview with Facebook through Interviewstreet about a year and a half ago and failed quickly, mostly because I'm not a native English speaker and I am really bad at speaking English. I keep practicing English after that, then I got another chance 2 months ago, recommended by a friend interning at Facebook.
The recruiter return to me very quickly, in less than a week, but I'm very busy and not well prepared at that time, so I did the phone interview a month later. I was asked to solve an easy coding problem, I finished it very quickly but made a small mistake in analyzing the complexity. I only found that mistake after the interview. The interviewer is very experienced, I have a great time talking to him after the coding phrase.
Then I got a chance to onsite. I had 3 interviews. 2 interviewers asked coding problems and 1 asked coding problems and also talked about my projects in resume. The problems are harder than the problem in phone interview. I really struggled at 1 of them. But I think I did a good job at another ones. The interviewer who talking with me about my projects is from a strong background and seems a little tough, I must say I was very nervous when talking to him, but luckily it turned out well.
In overall, the recruiters and the interviewers are all very nice. I am not familiar with the process of interviewing with companies in U.S and asked so many questions, the recruiters replied very quickly.
Generic LeetCode-style questions, many tagged as Meta, so extensive preparation is required to perform well in the technical interview. The experience varies significantly - some interviewers provide hints and guidance, while others expect candidates to solve problems independently with minimal assistance.
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