I applied through college or university. The process took 1 day. I interviewed at Meta (Zürich) in Oct 2017
Interview
Technical interview with an engineer at the campus. Started with a brief discussion about myself, followed by 2 algorithmic questions. The interviewer was pushing hard their solution to the second problem without trying to understand mine approach.
Interview questions [1]
Question 1
You have some tasks that take some time and interdependencies between them. You can execute as many tasks as you want in parallel. For the given task compute what is the earliest time that it can be completed.
Generic LeetCode-style questions, many tagged as Meta, so extensive preparation is required to perform well in the technical interview. The experience varies significantly - some interviewers provide hints and guidance, while others expect candidates to solve problems independently with minimal assistance.
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.
Interview questions [1]
Question 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.
Interview questions [1]
Question 1
Move zeroes in an array to the end while keeping non-zero element order, in place