La procedura ha richiesto un giorno. Ho sostenuto un colloquio presso Meta nel mese di mar 2009
Colloquio
A fairly young lady with limited skills asked basic questions about my background and what I hoped to gain from working for Facebook. She then asked what language I programmed best and resumed to ask about 10 trivial questions about the language. (ex. What is the difference between Java's Array and Vector classes). She seemed to have trouble even reading the questions so it was clearly someone who did not know the answers either. I was directed to attempt one of their online challenges and respond to her when completed.
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.
Standard cookie cutter interview with a coding interview, a system design interview and culture interview. The coding part is basically leetcode. The system design is what you can find on many youtube videos. The culture one is more tricky as they want to see that you fit Meta's culture, not that you were doing great at your existing company. So skills like dealing with conflict without calling in managers is sought after.
Domande di colloquio [1]
Domanda 1
coding: I forgot, sorry
system design: design ticketmaster
culture: talk about past project; when you disagreed with a peer; how I resolved dissagreements, etc.
The interview felt more straightforward than I anticipated for a well-known tech giant. After a recruiter screen, I faced a technical round that included a DSA question about finding the lowest common ancestor in a binary tree. I was pleasantly surprised when I realized the exact problem had popped up in the algorithm practice section on PracHub during my prep. Ultimately, the experience was decent, but I chose to decline the offer as it didn’t align with my current goals.
Domande di colloquio [1]
Domanda 1
Given a binary tree, find the lowest common ancestor of two given nodes in the tree.
