Aller au contenuAller au pied de page
  • Emplois
  • Entreprises
  • Salaires
  • Pour les employeurs

      Boostez votre carrière

      Découvrez votre salaire potentiel, décrochez des emplois de rêve et partagez vos témoignages de manière anonyme.

      employer cover photo
      employer logo
      employer logo

      Meta

      Employeur impliqué

      À propos
      Avis
      Salaires et avantages
      Emplois
      Entretiens
      Entretiens
      Recherches associées: Avis sur Meta | Offres d’emploi chez Meta | Salaires chez Meta | Avantages sociaux chez Meta
      Entretiens chez MetaEntretiens d’embauche pour Software Engineer chez MetaEntretien chez Meta


      Glassdoor

      • À propos
      • Récompenses
      • Blog
      • Nous contacter
      • Guides

      Employeurs

      • Compte employeur gratuit
      • Centre employeur
      • Blog pour les employeurs

      Informations

      • Aide
      • Règles de la communauté
      • Conditions d'utilisation
      • Confidentialité et choix publicitaires
      • Ne pas vendre ni partager mes informations
      • Outil de consentement aux cookies

      Travailler avec nous

      • Annonceurs
      • Carrières
      Télécharger l'application

      • Parcourir par :
      • Entreprises
      • Emplois
      • Lieux

      Copyright © 2008-2026. Glassdoor LLC. « Glassdoor », son logo, « Worklife Pro » et « Bowls » sont des marques déposées de Glassdoor LLC.

      Entreprises suivies

      Tenez-vous au courant des dernières opportunités et profitez de conseils d’initiés en suivant les entreprises de vos rêves.

      Recherche d’emplois

      Obtenez des recommandations et des mises à jour personnalisées en démarrant vos recherches.

      Entretien pour Software Engineer

      8 nov. 2011
      Candidat à l'entretien anonyme
      Aucune offre
      Expérience positive
      Entretien moyen

      Candidature

      Le processus a pris 4 semaines. J'ai passé un entretien chez Meta en oct. 2011

      Entretien

      First, a group of Facebook employees came to my campus to conduct on campus interview. There were 2 rounds of on campus interview - you had to pass the first round in order to get to the second. After the 2 rounds, you should be notified whether or not you receive the job. However, they asked me to complete a third and final phone interview. It took several weeks to schedule, but finally I had the phone interview. In the first interviews, I was only asked coding questions. The third was more behavioral, but we ended with a coding question.

      Questions d'entretien [4]

      Question 1

      Given a tree, print the values contained at each level on the same line. So if you had the tree with root A, and children B and C, you would print: A B C
      4 réponse(s)

      Question 2

      Find the min and max in an array. Now do it in less than 2n comparisons. (they were looking for the solution that finds both max and min in about 3/2 n comparisons).
      10 réponse(s)

      Question 3

      Compute the square root of a number down to a certain precision. ie sqrt(num, precision) returns a number that is in-between sqrt(num) - precision and sqrt(num) + precision.
      1 réponse

      Question 4

      What do you see as fb's biggest challenge in the next 5 years?
      Répondre à cette question
      6

      Autres retours d’entretien d’embauche pour un poste comme Software Engineer chez Meta

      Entretien pour Software Engineer

      1 juin 2026
      Employé (anonyme)
      Offre acceptée
      Expérience positive
      Entretien difficile

      Candidature

      J'ai passé un entretien chez Meta

      Entretien

      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.
      Répondre à cette question

      Entretien pour Software Engineer

      28 mai 2026
      Candidat à l'entretien anonyme
      Offre refusée
      Expérience neutre
      Entretien moyen

      Candidature

      J'ai passé un entretien chez Meta

      Entretien

      Standard cookie cutter interview with a coding interview, a system design interview and culture interview. The coding part is basically leetcode. The system design is what you can find on many youtube videos. The culture one is more tricky as they want to see that you fit Meta's culture, not that you were doing great at your existing company. So skills like dealing with conflict without calling in managers is sought after.

      Questions d'entretien [1]

      Question 1

      coding: I forgot, sorry system design: design ticketmaster culture: talk about past project; when you disagreed with a peer; how I resolved dissagreements, etc.
      Répondre à cette question

      Entretien pour Software Engineer

      28 mai 2026
      Candidat à l'entretien anonyme
      Offre refusée
      Expérience neutre
      Entretien moyen

      Candidature

      J'ai passé un entretien chez Meta

      Entretien

      The interview felt more straightforward than I anticipated for a well-known tech giant. After a recruiter screen, I faced a technical round that included a DSA question about finding the lowest common ancestor in a binary tree. I was pleasantly surprised when I realized the exact problem had popped up in the algorithm practice section on PracHub during my prep. Ultimately, the experience was decent, but I chose to decline the offer as it didn’t align with my current goals.

      Questions d'entretien [1]

      Question 1

      Given a binary tree, find the lowest common ancestor of two given nodes in the tree.
      Répondre à cette question