Ho presentato la mia candidatura online. La procedura ha richiesto un giorno. Ho sostenuto un colloquio presso Meta (Palo Alto, CA) nel mese di gen 2017
Colloquio
Went for an in-person tech screen. Was a 45-minute session with an engineer in a meeting room with a whiteboard. I was given a pretty tough question, and didn't do a stellar job at answering, but I also didn't have any professional experience with C++, which he said was their primary language, so I guess it's understandable that they passed on me.
Domande di colloquio [1]
Domanda 1
Given a list of denominations (e.g., [ 1, 2, 5 ] means you have coins worth $1, $2, and $5) and a number k, find all possible combinations, if any, of coins in the given denominations that add up to k, including repeats.
Ho sostenuto un colloquio presso Meta (Londra, Inghilterra)
Colloquio
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.
Domande di colloquio [1]
Domanda 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.
Domande di colloquio [1]
Domanda 1
Move zeroes in an array to the end while keeping non-zero element order, in place