J'ai postulé en ligne. Le processus a pris 6 semaines. J'ai passé un entretien chez Meta (Menlo Park, CA) en sept. 2024
Entretien
Phone interview with recruiter. The interviewer was very kind and patient. Answered all my questions to the best of their abilities. Sent me resources to study for the upcoming tech screen interview. Next rounds of tech screen were typical with a mix of theory, system design, and leetcode style coding.
Questions d'entretien [1]
Question 1
String manipulation, sorting strings in a list (you should know what the word lexicographical means), matrix traversal. System design in later round
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.
