I applied through college or university. The process took 2 weeks. I interviewed at Meta
Interview
Facebook came to our college for hiring of interns on the campus. The process included one coding round. It was carried out through Hacckerrank platform. I couldn't make it to interview round but those who did were screened with 2 telephonic interviews. There was only one question in coding round which was to be done in one hour.There was resume shortlisting after that. Those who were shortlisted were called for interviews.
Interview questions [1]
Question 1
No of possible pairs in an array that add up to a particular sum.
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