Candidatei-me por meio de uma faculdade ou universidade. O processo levou 2 meses. Fui entrevistado pela Meta (Kraków) em dez. de 2011
Entrevista
Facebook visited my university. We had a 45 min test and some of us were invited for 1:1 interview next day.
After that interview, recruiter contacted me like 2-3 weeks later and arranged phone interview.
Interviewers were very friendly. At the start they told me something about what they are working on, they gave me a small programming challenge. Interviewer wanted to know about my ideas for solving the problem and gave small hints if I got stuck.
Perguntas de entrevista [3]
Pergunta 1
Given a file with 3-letter words, print all 3x3 with each row, column and diagonal being one of the words from given file.
Given n+1 buckets with n of them with ball inside and move(a,b) function, that moves ball from bucket a to bucket b. Each ball has a different number from [1,n] on it. Move balls, so each bucket has a ball with matching number in it.
Candidatei-me por indicação de um funcionário. Fiz uma entrevista na empresa Meta.
Entrevista
I was invited to take their OA about a week after applying, mostly consisted of leetcode easy and mediums. It was a pretty smooth process, with quick feedback. Good experience overall
Perguntas de entrevista [1]
Pergunta 1
Data structures and algorithms, leetcode style medium and easy
Candidatei-me online. Fiz uma entrevista na empresa Meta.
Entrevista
They ask the normal standard DSA questions that you would expect for an internship like LeetCode mediums. I think there were two rounds of technical interviews before the offer stage.
Fiz uma entrevista na empresa Meta (Londres, Inglaterra).
Entrevista
DS&A questions, interview is just that with only a couple mins of non technical. Need to be quick and fluent in standard leetcode easy-med, and have decent enough grasp to come up with good ideas to approach leetcode hards.
Perguntas de entrevista [1]
Pergunta 1
DS&A. Asked about how to merge 3 ordered array into ordered array. Then, how to generalise for k ordered arrays. Was okay, but need to be faster and have solution down as if you can do it in your sleep.
