Solicité el puesto a través de un captador. El proceso duró 3 semanas. Acudí a una entrevista en Meta en dic 2014
Entrevista
HR approached me via email, asked to tell a little bit about my self, and what is my strongest programming language, sent me a mail with pointer where to learn from.
An phone Interview was set up for 3 weeks later.
it was on collabedit.com with skype. the interviewer was very nice, asked to talk a little bit about what I do.
asked one question.
if you need to implement bool Find(string str) which finds if a string exists in a dictionary
describe the data structure you will use.
a.write how one node of it will look like,
b. implement the function and add support for "?" wildcard which can return more than once.
Preguntas de entrevista [1]
Pregunta 1
I said suffix tree is the best way to go, so he asked me how will a node of that tree will look like?
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
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.
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
