Solicité el puesto a través de la recomendación de un empleado. El proceso duró 2 meses. Acudí a una entrevista en Meta (Londres, Inglaterra) en dic 2014
Entrevista
I got referred by a friend. After a 1-2 weeks I was contacted by a recruiter.
The first stage was composed of 2 phone interviews. This interviews are algorithm questions. The first one was about grouping anagrams the second one about range intersections.
After I passed this interviews I was invited for a day of onsite interviews. There where 3 onsite interviews, one was non-technical (about my background) and the other 2 technical (mostly algorithms and coding). Between the 2 technical interview I went for a coffee brake with an employee and I had the chance to ask him more questions about his work and about Facebook in general.
You a have a vector with the heights of an island (at point 1, point 2 etc) and you want to know how much water would remain on this island (without flowing away)
Write a function that takes a list of words as input, and returns a list of those words bucketized by anagrams with duplicates removed.
Example:
Input: ["star", "rats", "car", "arc", "arts", "rats", "bar"]
Output: [["star", "rats", "arts"], ["car", "arc"], ["bar"]]
Given 2 interval ranges, create a function to tell me if these ranges intersect. Both start and end are inclusive: [start, end]
Given 2 interval ranges that intersect, now create a function to merge the 2 ranges into a single continuous range.
Now create a function that takes a group of unsorted, unorganized intervals, merge any intervals that intersect and sort them. The result should be a group of sorted, non-intersecting intervals.
Now create a function to merge a new interval into a group of sorted, non-intersecting intervals. After the merge, all intervals should remain non-intersecting. You are given the function definition below.
Took about a month altogether, which felt longer given the intensity of the process. Kicked off with a technical screening, followed by two rigorous coding interviews. The DSA question on binary tree vertical order traversal hit me hard at first, but then I recognized the prompt instantly — I had just worked through something similar on PracHub. The final round was focused on system design, and while I ended up receiving an offer, I ultimately declined it. Overall, a challenging experience that definitely sharpened my skills.
1 leetcode med, 1 leetcode hard. make sure you know your DSA and leetcode questions. I wasn't able to get an offer bc i didnt complete the second question. Got a reply 2 days later saying they would move on
Overall, the process took a little over two weeks, which felt a bit longer than I anticipated. After a quick screening, I went through two technical rounds focusing on coding and DSA concepts. One of the questions was a classic palindrome check; mid-way through, I realized it was something I had practiced on PracHub just days earlier. The final step was a casual behavioral interview. I was relieved to get an offer shortly after, which I happily accepted.
Preguntas de entrevista [1]
Pregunta 1
Given a string, determine if it is a valid palindrome considering only alphanumeric characters and ignoring case.