El proceso duró 2 meses. Acudí a una entrevista en Meta (Palo Alto, CA) en jul 2011
Entrevista
Was referred by an employee and then contacted by an HR. Had 3 rounds of phone interviews and then was called for onsite interviews. The questions were aimed at testing coding and design skills. They are looking for people who can write the correct code at the first go. So my advice would be that you revise all the basic algorithms, look at the common interview questions and practice a lot of coding on paper/whiteboard. The level of questions was not as difficult as Google.
Preguntas de entrevista [5]
Pregunta 1
Implement a function
char* readLine();
which returns single lines from a buffer. To read the buffer, you can makes use of a function
int read(char* buf, int len)
which fills buf with upto len chars and returns the actual number of chars filled in. Function readLine can be called as many times as desired. If there is no valid data or newline terminated string available, it must block. In order to block, it can use read function which in turn will block when it doesn't have anything to fill the buf.
Implement a function string balanceParanthesis(string s); which given a string s consisting of some parenthesis returns a string s1 in which parenthesis are balanced and differences between s and s1 are minimum.
Eg - "(ab(xy)u)2)" -> "(ab(xy)u)2"
")))(((" -> ""
How will you design facebook newsfeed. Focus was on a design which could handle the huge number of status updates and display them on each of the user's friend's wall.
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.
Preguntas de entrevista [1]
Pregunta 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.
Preguntas de entrevista [1]
Pregunta 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.
Preguntas de entrevista [1]
Pregunta 1
Given a binary tree, find the lowest common ancestor of two given nodes in the tree.
