I applied through an employee referral. The process took 2 weeks. I interviewed at Meta (Pittsburgh, PA) in Apr 2015
Interview
I was ask to answer a few question about my resume and followed two coding questions. For each question, the interviewer asked the time and space complexity and how to improve them. At the end, he asked me whether if I had questions for him or the company.
Interview questions [1]
Question 1
1. Binary Tree level order traversal
2. Given a string and a pattern
'.' Matches any single character.
'*' Matches zero or more of the preceding element.),
find the first substring matching this pattern.
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.
