J'ai postulé via la recommandation d'un employé. Le processus a pris plus d'une semaine. J'ai passé un entretien chez Meta (Palo Alto, CA) en avr. 2014
Entretien
Was referred by an employee working at Facebook. Was paired with a HR guy who facilitated the process via email. Did a phone interview with an engineer about a week after first contact. Did the technical interview and was told I would get a decision within the week. Didn't get a response after trying to follow up so I took it as a no.
Questions d'entretien [1]
Question 1
The interview was pretty straightforward. The technical question had something to do with rearranging letters in a word, can't remember the details anymore.
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.
