Candidatei-me por meio de recrutador(a). O processo levou 6 semanas. Fui entrevistado pela Meta (Dublin, Dublin) em mar. de 2022
Entrevista
A telephone screening then I had to do 2 technical rounds though I was told it should be only one before onsite interviews. The first round went just fine and everything was clear and I did all what I was asked for.
For the second round the first task had such a weird requirement (solve without using division), I have never seen such a constraint anywhere in the 100s of problems I ever solved. I think it was trying to be innovative but it off-tracked the interview from technology-thinking to riddle-solving. For the second task: the interviewer seemed to have no knowledge of C# Dictionary data structure and kept insisting that I should use a set where the dictionary is more efficient in data access. The interviewer English language was so unclear that made it very hard for me to understand him. Most of the characters pronunciation was wrong causing words to be heard as all vowels. I even asked a question at the end of the interview after completing the tasks but I could not understand what he was saying at all however I had to giveup on it since time was already over.
Perguntas de entrevista [2]
Pergunta 1
Q1:
Given an array nums of n integers where n > 1, return an array output such that output[i] is equal to the product of all the elements of nums except nums[i].
Input: [4,3,2,1] Output: [6,8,12,24]
Please solve it
* without division operator
* in O(n).
Q2:
Given a short string S and a dictionary D, find out all possible ways to split S using words in D
Test example:
S = 'abcd' D = ['a', 'b', 'ab', 'cd'] -> ['a b cd', 'ab cd']
S = 'aaa' D = ['a'] -> ['a a a']
S = 'abcd' D = ['ab'] -> []
S = 'abcd' D = ['abcd'] -> ['abcd']
Spoke with interviewer over video conferencing. He was very communicative . He answered my questions. Asked me BFS question. A question that involved BFS search. Given a matrix, I am suppose to find a path from top left to down right.
Perguntas de entrevista [1]
Pergunta 1
A question that involved BFS search. Given a matrix, I am suppose to find a path from top left to down right.
The technical round hit me with a classic array manipulation problem: moving zeroes to the end without disrupting the order of non-zero elements. As I tackled it, I felt a wave of familiarity wash over me; I had just practiced a similar challenge on PracHub. The rest of the interview followed a straightforward path, with some easy behavioral questions sprinkled in. Overall, it felt very easy, but I wasn’t quite the right fit for what they needed, so I didn’t receive an offer.
Perguntas de entrevista [1]
Pergunta 1
Move zeroes in an array to the end while keeping non-zero element order, in place
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