A recruited contacted me via email. They set up a screening tech round to be followed by other interviews. I had to postpone the screening interview a few times due to personal reasons. They were very flexible about it and let me reschedule twice.
Ho presentato la mia candidatura online. Ho sostenuto un colloquio presso Meta nel mese di gen 2026
Colloquio
I applied for a Machine Learning Research Scientist (PhD) position. I did pretty well in the initial CodeSignal screening and passed all four test cases, but I did not move forward to the next stage. It seemed the role might have been leaning toward an internal candidate or my resume was not enough
Domande di colloquio [1]
Domanda 1
The first screening was data structures and algorithms (DSA), with questions at a LeetCode easy to medium level (moslty medium). I did not feel constrained by time and was able to complete the questions without time pressure
Ho presentato la mia candidatura tramite un selezionatore. La procedura ha richiesto 2 mesi. Ho sostenuto un colloquio presso Meta (Menlo Park, CA) nel mese di feb 2025
Colloquio
A recruiter reached out to me and scheduled a technical screening interview, which consisted of two LeetCode easy/medium problems. After passing the screening, I moved on to the virtual onsite interviews, which included:
2 coding interviews (LeetCode medium/hard),
1 ML system design interview (focused on a binary classification problem), and
1 behavioral interview
The interviewers were friendly and supportive throughout the process.
Ho presentato la mia candidatura tramite un selezionatore. La procedura ha richiesto 2 mesi. Ho sostenuto un colloquio presso Meta (San Francisco, CA) nel mese di feb 2025
Colloquio
A recruiter contacted for a Machine Learning role related to software development. The interview process consisted of 1 screening round and then 4-5 final interviews.
Only did the screening round which had 2 medium difficulty string-based leetcode questions.
Domande di colloquio [1]
Domanda 1
1. Find all missing numbers in an array. Append each to a string.
2. Find overall max length of repeating substrings in a string. Print first character of each repeating substring with max value.
