Ho presentato la mia candidatura tramite l'università. La procedura ha richiesto 2 settimane. Ho sostenuto un colloquio presso Meta (Pittsburgh, PA) nel mese di feb 2014
Colloquio
It was an on-campus interview in CMU. I went to one of the job affairs of the university, and received an email about the interview within a week.
Facebook also held a candidate reception in one of the plazas near CMU campus. We got the chance to know our interviewers in advance to ask any questions.
Domande di colloquio [1]
Domanda 1
As for the interview itself, I was asked several general questions about my projects (nothing too special, really). The coding question is a standard regular expression matching one which you can find on LeetCode. Since I'm still doing my Master program, I haven't yet reached that far on LeetCode. I did solve the question in the end after the interviewer gave me some hint...But I don't think I did a very good job.
Took about a month from start to finish, which felt longer than I expected. After a couple of initial phone screenings, I faced a challenging technical round focused on system design. It was during this round that I was asked to describe overcoming a major career challenge. Interestingly, I had just reviewed a similar framework on PracHub, which helped me articulate my thoughts clearly. Overall, I appreciated the depth of the process and ended up accepting the offer.
Domande di colloquio [1]
Domanda 1
Describe Overcoming a Major Challenge in Your Career
Ho sostenuto un colloquio presso Meta (Seattle, WA)
Colloquio
The entire process usually takes 3–8 weeks, depending on scheduling and the specific role. Coding interviews heavily emphasize common DSA topics such as arrays, strings, trees, graphs, BFS/DFS, heaps, hash maps, and dynamic programming. System design becomes increasingly important for E4+ positions.
Domande di colloquio [1]
Domanda 1
Given an array of integers and a target value, return the indices of two numbers that add up to the target
Unexpectedly, the first question in the technical round felt familiar. It was about finding a subset of strings with unique character concatenation — same problem I had worked through on PracHub a few days earlier. The interview included a recruiter screen followed by a rigorous pair of technical interviews where I tackled data structures and algorithms alongside system design concepts. After successfully answering a few more challenging DSA questions, I received an offer. The entire experience was intense but ultimately rewarding, and I happily accepted the position.
Domande di colloquio [1]
Domanda 1
Given an array of strings, pick a subset whose concatenation contains no duplicate characters, and return the maximum possible length of that concatenation.
