Ho presentato la mia candidatura tramite l'università. La procedura ha richiesto un giorno. Ho sostenuto un colloquio presso Meta (Ann Arbor, MI) nel mese di mar 2013
Colloquio
They came to my university, two 30 minute interviews, first one was pretty basic, 2nd one was hard. It was a pretty simple process, there were about 10-15 other people interviewing with me, it was for a standard Summer intern position at Facebook. They came to my school and interviewed a bunch of people, a lot of them through a hackathon at the school.
Domande di colloquio [1]
Domanda 1
If you have an array of hundreds of strings, how would you eliminate all anagrams (strings with the same characters in a different order).
Recruiter call was pretty standard, first round was 2 Meta tagged LC mediums in 45 minutes. On-site was 2 coding sessions of 2 LC mediums, a system design interview and a behavioral interview with an engineering manager.
Domande di colloquio [1]
Domanda 1
How do you answer if someone asks how long a deliverable or project will take?
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.
