I applied online. The process took 3 weeks. I interviewed at Meta (Menlo Park, CA) in Feb 2013
Interview
I solved a challenged at interviewstreet.com
2 weeks after they emailed me asking to send my CV along with some answers, for example: preferred programming languages, current job, time constrains, availabity for interview...
Another email telling me about how to get prepared for the interview (visiting glassdor.com).
After I replied, 1 week later we coordinated the skype interview.
The interview was kind and explained to me any doubt I had.
They called me explaining the good and bad things I did on my first phone screener, and then we planned a second interview. I was able to solve the second problem but probably I took more time than expected and had some bugs that the interviewer helped me to find out.
The day after the second interview I was said "thanks" by Facebook, that my background didn't fit any current position.
Interview questions [1]
Question 1
1.1. given a list of words, group anagrams.
1.2. find all 3 items that sum to 0 in an array.
2.1. Write a function that calculates input strings with operators +,-,*,/ eg. "5+5*6" should output 35
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.
