J'ai postulé via la recommandation d'un employé. Le processus a pris 2 semaines. J'ai passé un entretien chez Meta (Menlo Park, CA) en juil. 2014
Entretien
Introduced into the whole process via a referral, so I was able to move quickly to an onsite interview. This was easily the best interview experience I've had in a long time - recruiter was friendly and extremely responsive, and each of the interviews was engaged during the interview.
Everything moved very quickly once I indicated that I felt prepared to interview.
Questions d'entretien [1]
Question 1
Nothing terribly surprising - be prepared to talk through CS fundamentals, large scale design, and code code code.
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.
Questions d'entretien [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.
Questions d'entretien [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.
Questions d'entretien [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.
