I applied through an employee referral. The process took 4 weeks. I interviewed at Meta (New York, NY) in Nov 2024
Interview
Initial recruitement screen to gauge logistics and lightly peruse your background and interest.
First Technical round comprised of two leetcode medium difficulty problems under a time constraint of roughly 40 minutes for both. The interviewers may give hints to guide you, but too many hints might signal that you’re not meeting expectations.
Preparation Tips:
Familiarize yourself with the LeetCode 75 or 150 problems, focusing on medium-to-hard difficulty.
Practice coding in a pressure environment and explaining your approach as you go.
I didn't make it past the intial technical but here's an overview:
Q1 Focus: Optimization skills and problem-solving efficiency.
Q2 Focus: Ability to design and utilize custom data structures while demonstrating a deep understanding of algorithm complexity and performance trade-offs.
Interview questions [1]
Question 1
Array Problem to assess medium difficulty Algo knowledge:
The problem involves testing whether you can optimize an
𝑂(𝑛^2) time complexity algorithm into an 𝑂(𝑛) solution. This typically requires identifying a more efficient approach, such as using hash maps, sliding windows, or prefix sums, depending on the context.
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