Candidatei-me por indicação de um funcionário. O processo levou 2 semanas. Fui entrevistado pela Meta (Menlo Park, CA) em ago. de 2015
Entrevista
Initial 45 minute screen: whiteboard coding problem, algorithmically simple, but with oddities.
Full loop: 6 x 45-minute sessions: 2 coding, 2 design, 1 cultural/technical (tell a story about a difficult experience and how I overcame), 1 lunch (off-the-record chance to ask tons of questions about company culture)
Perguntas de entrevista [1]
Pergunta 1
Design a real-time type-ahead search-phrase predictor which presents the top-10 ranked search strings that begin with a given prefix.
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.
Perguntas de entrevista [1]
Pergunta 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.
Perguntas de entrevista [1]
Pergunta 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.
Perguntas de entrevista [1]
Pergunta 1
Given an array of strings, pick a subset whose concatenation contains no duplicate characters, and return the maximum possible length of that concatenation.
