Overall, the whole interview process took about three weeks, which felt longer than I expected given the urgency for the role. The technical round was challenging, featuring a problem on valid parentheses that required a single-pass stack approach. As I discussed edge cases, I remembered similar patterns I had been practicing on PracHub just days prior, and those hours definitely paid off. After a couple of behavioral interviews, I was thrilled to receive an offer, which I happily accepted.
Domande di colloquio [1]
Domanda 1
Given a string s containing parentheses and letters, remove the minimum number of parentheses so that the resulting string is valid (Minimum Remove to Make Valid Parentheses). Walk through a single-pass stack approach to mark unmatched opens, then a second pass to drop unmatched closes, with O(n) time and O(n) space. Discuss edge cases like all-letter strings, deeply nested groups, and whether multiple valid answers exist.
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