J'ai postulé en ligne. Le processus a pris 4 semaines. J'ai passé un entretien chez Meta (California City, CA) en janv. 2025
Entretien
1. Recruiter Screening - Described about the interview process, asked background experience.
2. Technical Screening round - 2 medium leet code questions
3. Full Day loop interview consisting of 5 rounds
2 - Technical coding rounds - Each 2 coding questions of easy to medium questions.
2 - Behavioral rounds - Project experiences and classic behavioral type questions like how you handle conflict, challenging situation, the project you are proud of etc.,
1 - System Design round - Design a leetcode coding contest platform
Questions d'entretien [1]
Question 1
1. What have you learned from your previous company?
2. Describe a conflict at work.
3. How do you manage to work on a project where you didn’t get along with your colleagues?
4. Tell us about a time when you failed in one of your projects.
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
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.
