J'ai postulé via un recruteur. Le processus a pris 3 jours. J'ai passé un entretien chez Meta (Londres, Angleterre) en mai 2015
Entretien
Stage one was a phone screen, clearly intended to give them a feel for whether I can think on my feet or not.
Then, a full day of interviews in the office - mixture of coding and culture fit interviews, where the culture fit interviews were done by underrepresented groups, and the coding interviews were mixed. Again, very clear that the goal was to get me a chance to sink or swim on my own merits.
Coding interviews were split between coding on laptop and coding on whiteboard, to give me a chance to come back if I can't code on a whiteboard.
That came back unsure, so I came in for one last interview session.
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.
