I applied through other source. The process took 2 weeks. I interviewed at Meta (Tel Aviv) in Feb 2016
Interview
They were very nice. First I was contacted by a girl that said she will pass my C.V on. Afterwards a guy who was in the same field area as of me interviewed me. All the interaction was on the phone.
Interview questions [1]
Question 1
You have a 4 x 4 board with words. For example:
A B G H
O L L E
E R T Y
G E F Y
You need to write a function that finds if a certain word exists in the board. The rules are as followed:
1. Each character needs to be close to one another (neighbor cell). For example: The function will return false for the word HERE but true for the word HEY.
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.
