Me postulé a través de una recomendación de un empleado. El proceso tomó 6 semanas. Acudí a una entrevista en Meta (Menlo Park, CA) en nov 2015
Entrevista
Applied through employee referral. Got a phone screen about two weeks later. Didn't get contacted for about 4.5 weeks, then was asked to come onsite to Menlo Park campus. The onsite was one 45 minute interview with one interviewer, and then a tour. Received a phone call the day after with the offer.
Preguntas de entrevista [1]
Pregunta 1
Phone screen: Given a list of numbers and a function that returns Low, Medium, or High, sort the list by Lows, then Mediums, then Highs.
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.
Preguntas de entrevista [1]
Pregunta 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.
Preguntas de entrevista [1]
Pregunta 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.
Preguntas de entrevista [1]
Pregunta 1
Given an array of strings, pick a subset whose concatenation contains no duplicate characters, and return the maximum possible length of that concatenation.
