Candidatei-me online. O processo levou 3 semanas. Fui entrevistado pela Meta (San Jose, CA) em mai. de 2019
Entrevista
Phone call with recruiter, phone technical screen followed by on site technical interview. Overall a fast process and recruiters were also fast in scheduling and responding. Company culture is very nice. Employees seemed happy.
Perguntas de entrevista [1]
Pergunta 1
Tech phone screen was general tech conversation of technologies worked on, projects and past work experience and telling me about the work and culture at Sage Intacct. The interviewer was very sweet and polite.
On Site:
All Questions were Leetcode HARD level questions variations, being copy pasted or typed exactly from Leetcode HackerRank by looking at screen.
1 was a tricky variation of the number of islands question from LeetCode, one was a super hard DP problem similar to coins problem of Leetcode. I mentioned to the interveiwer that although a DP solution is available, I am not comfortable with DP and hence doing the iterative version, he reacted in a very confused way as to 'why DP/what DP'. After I gave the full solution on the board, the interviewer didn't seem interested in discussing the approach or anything else. He just wanted me to write the same code from the board on HackerRank coding screen and submit it. Obviously, in the last 12-14 min, I couldn't complete this question at all.
This was followed by a system design question about online collaborative editing tool.
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