I applied through a recruiter. The process took 3 weeks. I interviewed at Meta in Mar 2019
Interview
I was reached out to by a recruiter asking if I was interested in sending over my resume/interviewing with Facebook. Within an hour of e-mails I had my first phone interview scheduled. It was scheduled for only about 45 minutes, about 30-35 of that reserved for programming problems. The problems were done with coderpad while on the phone, speaking to the interviewer. The first interviewer was really polite and sounded excited about the interview. As with any programming interview, I spoke out loud my thought process and the interviewer was interacting a lot with me along the way, it made me feel much more positive and made me forget about any lingering anxiety. After the weekend I learned I had made it to the second round of phone interviews. This interviewer sounded much less excited, I really got the vibe that they didn't want to be doing this. Where the first interviewer would interact with me, this one was almost a brick wall, and let me waste 5 minutes of our conversation looking for bugs (there was one in my code, the other "bug" was due to their lack of knowledge in my chosen language). At the end, we ran out of time and I didn't get to ask many questions. I felt kind of strapped for time near the end of both interviews, but the second was much worse.
Interview questions [4]
Question 1
Given a list of points and a number k, find the k closest points to the origin.
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