Candidatei-me por indicação de um funcionário. O processo levou 2 meses. Fui entrevistado pela Meta (Londres, Inglaterra) em dez. de 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.
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.
Perguntas de entrevista [1]
Pergunta 1
Given a string, determine if it is a valid palindrome considering only alphanumeric characters and ignoring case.
Candidatei-me online. Fiz uma entrevista na empresa Meta (Menlo Park, CA).
Entrevista
It's honestly striaght from leetcode tagged
There are no surprises if you do tagged you would be good and do well.
System design is much harder. Would recommend using hello interview.
Perguntas de entrevista [1]
Pergunta 1
Design Twitter and consider if it was suddenly an extremely low latency env
Grateful doesn't even begin to describe how I feel about landing this role. The interview loop was smooth and friendly. They kicked things off with a technical round where I faced a DSA question about verifying an alien dictionary. Lucky for me, the time I'd spent on PracHub paid off, as it had the same type of problem just days before. After that, I had a system design discussion and a behavioral interview. Everything felt very collaborative, and by the end, I received an offer that I was thrilled to accept.
Perguntas de entrevista [1]
Pergunta 1
Given a list of words written in an alien language and the order of letters in that language's alphabet, determine whether the words are sorted lexicographically (Verifying an Alien Dictionary). Walk through the comparison approach using a character-to-index map, the O(C) time complexity where C is total characters, and how you'd extend it to handle words with mixed-case letters or words containing characters outside the given alphabet.