I applied through a recruiter. The process took 1 day. I interviewed at Meta in Jun 2013
Interview
I was contacted by a recruiter via telephone. The phone conversation was simple enough to warrant a trip to the office. The office was nice- catered food, and unlimited soda and candies. The first round interview lasts about 1 hour and consists of questions (no surprise) asking about time complexities calculation and data structures. Make sure you at LEAST know tree traversals before you go into the interview. Given the short time limit, feel free to ask your interviewer for help to speed up your answering.
Interview questions [1]
Question 1
Questions were purely academic, nothing unexpected.
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