I applied through a recruiter. The process took 3 weeks. I interviewed at Meta (Menlo Park, CA) in Mar 2014
Interview
I was contacted by a recruiter in early 2014. I was set up with an engineer for a phone interview. The first few questions were about my resume, simple stuff about projects I've worked on and prior experience. Then I was asked two technical questions, one about recursion and one about trees. I fully solved and optimized the tree problem but struggled a bit with the recursive problem. Overall it wasn't too difficult but make sure you prepare well before going in!
Interview questions [1]
Question 1
A recursive problem involving how many combinations you can make out of a set of numbers. Know your data structures, the problem used both hash tables and lists.
Took about a month altogether, which felt longer given the intensity of the process. Kicked off with a technical screening, followed by two rigorous coding interviews. The DSA question on binary tree vertical order traversal hit me hard at first, but then I recognized the prompt instantly — I had just worked through something similar on PracHub. The final round was focused on system design, and while I ended up receiving an offer, I ultimately declined it. Overall, a challenging experience that definitely sharpened my skills.
1 leetcode med, 1 leetcode hard. make sure you know your DSA and leetcode questions. I wasn't able to get an offer bc i didnt complete the second question. Got a reply 2 days later saying they would move on
Overall, the process took a little over two weeks, which felt a bit longer than I anticipated. After a quick screening, I went through two technical rounds focusing on coding and DSA concepts. One of the questions was a classic palindrome check; mid-way through, I realized it was something I had practiced on PracHub just days earlier. The final step was a casual behavioral interview. I was relieved to get an offer shortly after, which I happily accepted.
Interview questions [1]
Question 1
Given a string, determine if it is a valid palindrome considering only alphanumeric characters and ignoring case.