Ik heb via een hogeschool of universiteit gesolliciteerd. De procedure duurde 1 dag. Ik heb gesolliciteerd bij Meta (Pittsburgh, PA) in okt 2011
Sollicitatiegesprek
The interview process comprised of a technical round held at my university. My interviewer was very polite, and patiently explained the problem statement to me. I asked for further clarification of the problem statement, to which he mapped out the problem on the whiteboard. The challenge involved writing code in whichever language I was comfortable in. The problem was to convert roman literals into its equivalent numeric value. I used the whiteboard to solve the problem. I walked the interviewer through the solution and he asked questions on edge case scenarios.
Overall, the interview went ok, but I did not receive a next round call. This was probably because my solution was not optimal and upto their expectations. It was a good experience and I learnt a lot from it
Ik heb via een werknemersdoorverwijzing gesolliciteerd. Ik heb gesolliciteerd bij Meta
Sollicitatiegesprek
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
Sollicitatievragen [1]
Vraag 1
Data structures and algorithms, leetcode style medium and easy
Ik heb online gesolliciteerd. Ik heb gesolliciteerd bij Meta
Sollicitatiegesprek
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.
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.
Sollicitatievragen [1]
Vraag 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.
