I applied through an employee referral. The process took 1 week. I interviewed at Meta in Jan 2014
Interview
Phone interview and then on site. In the phone interview, they ask me to solve the 3 sum problem (check leetcode) and the bucket anagram problem. In the on site interview, 3 interviewers ask me three algorithm problems and also the behavior problems. Then there's a brief tour to the campus.
Interview questions [1]
Question 1
On site interview, they ask me regular expression match (check leetcode) and search for range (like, 1,2 3, 7,7,7, 9, 9, return how many 7's in the array) and also knowledge about the garbage collection, linked list, reverse linked list.
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.
Interview questions [1]
Question 1
How do you answer if someone asks how long a deliverable or project will take?
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.
