Ho presentato la mia candidatura online. La procedura ha richiesto un giorno. Ho sostenuto un colloquio presso Meta (Tel Aviv) nel mese di dic 2015
Colloquio
They were very professional, they sent me a lot of emails on how to prepare to your interview for Facebook.
They made there an internet live sessions with current developers where you can ask questions about the process and about questions they may ask you in the interview.
First they make a phone interview where they ask a code question and you have about 40 minutes to answer.
There was only one thing I was unhappy about, in the live session before the phone interview they said there that the most important thing is to solve the problem they asked you, and only then try to improve your code, well in my interview I solved the problem in only 30 minutes but wouldn't able to improve code efficiency in the last 10 minutes, and a day later they sent me an email saying that it wasn't good enough.
well.. what can you do.. it's Facebook.
Domande di colloquio [1]
Domanda 1
you have a list of people, and a function that return true/false if one person knows the second person.
write a function that finds a VIP, which everybody knows and he doesn't know anybody else.
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.
