I applied through a recruiter. The process took 2 weeks. I interviewed at Meta in May 2012
Interview
A recruiter contacted me telling that he got my contacts from a list of an online programming competitions website. Then, he scheduled a first screening interview that consisted of basic questions like "why facebook". Then, they scheduled technical phone interview. I passed it and waiting for the onsite interview. The onsite interview consisting of 4 phases, 1 cultural behavior, 2 coding and 1 design performance interview.
Interview questions [1]
Question 1
Given the root of a binary search tree along with a node inside it, find the successor node for the given one.
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.
