I applied online. The process took 1 day. I interviewed at Meta (New York, NY) in Jan 2025
Interview
Applied online. After a short call with the technical recruiter, I got a link to schedule an interview for a E3-E4 position.
The first technical interview wasn't difficult at all, but I didn't have time to go through the most common problems on LC, so obviously I got rejected.
Everyone was very nice and helpful during my short recruitment process.
Interview questions [1]
Question 1
I got 2 LC mediums: one of array problems, one of graph problems. I've tagged them
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