J'ai postulé via un recruteur. Le processus a pris 2 semaines. J'ai passé un entretien chez Meta (Chicago, IL) en nov. 2012
Entretien
I was participating in Facebook Midwest Regional Hackathon, and got contacted by the recruiter shortly thereafter at my university. We scheduled the first phone interview, which was a technical interview. The questions included printing binary search tree in reverse, finding k-th largest element in O(N) without modifying the node, and then same k-th largest element in log(N) time keeping the size of the subtree in each node.
Questions d'entretien [1]
Question 1
"Reverse" of the problem if finding k-th smallest element in a tree: I had to find k-th largest.
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.
Questions d'entretien [1]
Question 1
Move zeroes in an array to the end while keeping non-zero element order, in place
1 leetcode med, 1 leetcode hard. make sure you know your DSA and leetcode questions. I wasn't able to get an offer bc i didnt complete the second question. Got a reply 2 days later saying they would move on