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.
Recruiter call was pretty standard, first round was 2 Meta tagged LC mediums in 45 minutes. On-site was 2 coding sessions of 2 LC mediums, a system design interview and a behavioral interview with an engineering manager.
Interview questions [1]
Question 1
How do you answer if someone asks how long a deliverable or project will take?
The entire process usually takes 3–8 weeks, depending on scheduling and the specific role. Coding interviews heavily emphasize common DSA topics such as arrays, strings, trees, graphs, BFS/DFS, heaps, hash maps, and dynamic programming. System design becomes increasingly important for E4+ positions.
Interview questions [1]
Question 1
Given an array of integers and a target value, return the indices of two numbers that add up to the target
Unexpectedly, the first question in the technical round felt familiar. It was about finding a subset of strings with unique character concatenation — same problem I had worked through on PracHub a few days earlier. The interview included a recruiter screen followed by a rigorous pair of technical interviews where I tackled data structures and algorithms alongside system design concepts. After successfully answering a few more challenging DSA questions, I received an offer. The entire experience was intense but ultimately rewarding, and I happily accepted the position.
Interview questions [1]
Question 1
Given an array of strings, pick a subset whose concatenation contains no duplicate characters, and return the maximum possible length of that concatenation.
