2 rounds of technical interviews, each round has 2 coding problems. The first problem is usually easy/medium, and the second one is medium/hard. Their decisions came out very fast, about 2-3 days.
Ho presentato la mia candidatura tramite segnalazione di un dipendente. La procedura ha richiesto 3 settimane. Ho sostenuto un colloquio presso Meta (New York, NY) nel mese di feb 2024
Colloquio
I have two screening interview using zoom and Coderpad. There were two Leetcode easy/median level problems. For all of the problems I was asked to give a dry-run and how I could improve them with respect to time/space complexity.
Domande di colloquio [3]
Domanda 1
The First problem was to find out the k-th largest number from a integer list.
The third problem was to store vectors with repeated elements, such as 221115555222, 1110011, and then write the method to compute the dot product between two above vectors.
I didn't remember the fourth problem, but it should not be difficult.
