Me postulé a través de un reclutador. El proceso tomó 3 días. Acudí a una entrevista en Meta (Menlo Park, CA) en jun 2014
Entrevista
I was contacted by the recruiter through linkedin. I had an initial call with the recruiter where I was asked about my interests and what I might be looking for. Recruiter explained me the entire process on how the interview goes. Usually they have an initial phone interview, where you have to write code through collabedit. After that in person interview.
Phone interview was all about data structures. First the interviewer asked me what interests me about facebook, what is one thing about facebook I like. After that interviewer asked me to print a binary tree in level order. I did that. And then I was asked to print the tree in level order but using DFS. Interviewer was nice, was giving a lot of hints whenever I was stuck. Overall, a good experience.
Preguntas de entrevista [1]
Pregunta 1
Nothing difficult for someone who would be clear on data structures I guess.
Took about a month from start to finish, which felt longer than I expected. After a couple of initial phone screenings, I faced a challenging technical round focused on system design. It was during this round that I was asked to describe overcoming a major career challenge. Interestingly, I had just reviewed a similar framework on PracHub, which helped me articulate my thoughts clearly. Overall, I appreciated the depth of the process and ended up accepting the offer.
Preguntas de entrevista [1]
Pregunta 1
Describe Overcoming a Major Challenge in Your Career
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.
