J'ai postulé via un établissement d'enseignement supérieur ou universitaire. Le processus a pris 4 semaines. J'ai passé un entretien chez Meta en mars 2015
Entretien
I had two technical interviews (they are not back-to-back, with about a two-week interval) plus one team matching interview on the phone. The whole process took 4~5 weeks. In both tech. interviews, there were two simple algorithm problems. My interviewer shared me a link on collabedit and I just coded there. All questions were quite basic and nothing surprising happened.
Questions d'entretien [1]
Question 1
Q1A: In a maze with empty spaces and walls, given a starting point and ending point, find a path (not necessarily shortest). (Just BFS, DFS...)
Q1B: If the maze is stored on multiple nodes on a cluster, what do we have to do? (No coding, just give ideas)
Q2: Given an array and a target number, tell whether there are three numbers in the array which add up to the target number. (Time complexity should be O(n^2))
Q3: Topological sort.
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.
Questions d'entretien [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.
Questions d'entretien [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.
