Ho presentato la mia candidatura tramite l'università. La procedura ha richiesto 2 settimane. Ho sostenuto un colloquio presso Meta
Colloquio
Met at campus career fair
Submitted resume
Invited to first round. A lot of chatting, then tech questions.
Invited to second round at HQ. Tech interview in the morning, then lunch, and A LOT more chatting, and getting to know Facebook.
Questions.
Round 1.
1. Function to check if 2 words are anagrams
2. Function to check if any 3 numbers sum to x.
Round 2.
You are given 2 streams of data, representing very sparse vectors
you are guaranteed that the 2 incoming streams are of same size
give a data structure which is optimized for producing the dot product of those sparse vectors
analyze your runtime/space complexity,
b) what if you are now told that v1, is much more sparse than v2
give another (or the same) data structure optimized for the dot product of any such 2 vectors (where 1 is more sparse than the other)
analyze your runtime/space complexity,
41
Altre recensioni di colloqui per Software Engineer Intern presso Meta
Ho presentato la mia candidatura tramite segnalazione di un dipendente. Ho sostenuto un colloquio presso Meta
Colloquio
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
Domande di colloquio [1]
Domanda 1
Data structures and algorithms, leetcode style medium and easy
Ho presentato la mia candidatura online. Ho sostenuto un colloquio presso Meta
Colloquio
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.
Ho sostenuto un colloquio presso Meta (Londra, Inghilterra)
Colloquio
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.
Domande di colloquio [1]
Domanda 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.
