Onsite interview process was fair. Difficulty level was average. First person to interview me had horrible communication skills. He couldn't explain coding problem clearly.
Remaining three people were very good in communication. After on-site interview, facebook requested for yet another coding phone interview.
Post onsite phone interview is what went wrong with me. This person had poor interview skills. He asked me an advanced algorithm question about graph/tree traversal (search for "same fringe problem concurrency" and you will know what I am talking about). I gave a natural solution which was not space efficient, but interviewer was looking for a specific solution he had in mind.
I lost the deal to this question. I would give thumbs up to recruiters handling interview process. I think they are one of the best in the industry.
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