Ho presentato la mia candidatura tramite un selezionatore. Ho sostenuto un colloquio presso Meta
Colloquio
Typical 2-3 leetcode questions to complete in 45 minutes with edge cases and working code. Its based on luck if you get what you already prepared. Just go through top fb questions and hope that they ask you from that list
Ho presentato la mia candidatura tramite segnalazione di un dipendente. Ho sostenuto un colloquio presso Meta
Colloquio
OA, 3 questions, medium
Coding interview
1 round, 45 minutes, with an engineer.
Done in an online collaborative editor CoderPad without auto-complete or test runner enabled. 2 data structures / algorithms problems (LeetCode easy–medium, occasionally touching medium–hard).
system design
behavioral
Domande di colloquio [1]
Domanda 1
You are given an integer array nums and an integer k.
Return the length of the longest subarray whose elements sum to exactly k.
The subarray must be contiguous.
nums may contain positive, negative, and zero values.
If no such subarray exists, return 0.
Ho presentato la mia candidatura online. La procedura ha richiesto 3 settimane. Ho sostenuto un colloquio presso Meta (Redmond, WA) nel mese di ott 2024
Colloquio
3 interviews, each with a software engineer asking me to implement functions in python. Like implement a convolutional layer. The questions were not difficult; there were some trick questions in terms of knowing you can find the median in O(n) with quick select, as opposed to O(n*log(n)) with sort and grab the middle element.
Domande di colloquio [1]
Domanda 1
Implement convolutional layer in python
Find the median of an unsorted array in python
