I applied through an employee referral. The process took 2 weeks. I interviewed at Meta (Palo Alto, CA) in Dec 2011
Interview
A recruiter contacted me after a mutual friend gave them my resume. They were aware that I had a pending offer that I had to make a decision on, and were very good about moving the process along as quickly as possible.
I lived nearby, so I did two on-site interviews initially. After completely bombing one of them but doing well on the other I was brought in a little bit later for the full interview. I had about 5 people interview me. Afterwards they were still unsure so I had a couple phone interviews/conversations.
The recruiter did a great job of keeping me up-to-date about what was happening, was very honest with me, and was able to rush to get me an offer (which was especially nice because it was almost Christmas at the time)
Interview questions [1]
Question 1
Many of the interviews focus on coding exercises. It can be very hard to write code on a whiteboard with someone watching you. People are right about it being a good idea to practice writing on a whiteboard on your own first.
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.
Interview questions [1]
Question 1
Describe Overcoming a Major Challenge in Your Career
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.
Interview questions [1]
Question 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.
Interview questions [1]
Question 1
Given an array of strings, pick a subset whose concatenation contains no duplicate characters, and return the maximum possible length of that concatenation.
