Took about a month from start to finish, which felt longer than I expected. After a couple of initial phone screenings, I faced a challenging technical round focused on system design. It was during this round that I was asked to describe overcoming a major career challenge. Interestingly, I had just reviewed a similar framework on PracHub, which helped me articulate my thoughts clearly. Overall, I appreciated the depth of the process and ended up accepting the offer.
Questions d'entretien [1]
Question 1
Describe Overcoming a Major Challenge in Your Career
J'ai postulé via la recommandation d'un employé. Le processus a pris plus d'une semaine. J'ai passé un entretien chez Meta
Entretien
I was referred by a friend.
Whole process took a week in a half - due to a pending deadline on my part.
I had a phone interview and was then invited onsite at the end of the week. The onsite interview was composed of 3 interviews. They were typical questions of any other technical interview questions - although slightly more tree-heavy than other companies.
On Monday I was contacted asking to provide references. I thought I had it in the bag because of this but Tuesday evening I was rejected.
I know that they were strong and wouldn't cause my rejection. So I guess references are asked for before the onsite interviews are processed?
Questions d'entretien [1]
Question 1
I signed an NDA so won't disclose the exact questions - but I'd practice up on tree traversals before interviewing
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.
