Candidatei-me por meio de uma faculdade ou universidade. Fiz uma entrevista na empresa Meta.
Entrevista
Interview was 45 minutes long. Two coding questions were asked. Interview was based on data structures and algorithms. Prepare tree data structure well. Be ready for dynamic programming questions. Brush up algorithm techniques, basics of any data structures.
Perguntas de entrevista [1]
Pergunta 1
1. Binary Tree Traversals
2. Sum of contiguous array elements
Fiz uma entrevista na empresa Meta (Londres, Inglaterra).
Entrevista
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.
Perguntas de entrevista [1]
Pergunta 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.
Perguntas de entrevista [1]
Pergunta 1
Move zeroes in an array to the end while keeping non-zero element order, in place