Meta Interview Experience

Experience
1.5 years
Posted
5 Apr 2025
327 reads

Summary

I went through a Meta interview process, detailing my friend's experience which included several rounds of coding, system design, and behavioral questions. Despite receiving positive feedback across all rounds, I was not extended an offer, which I believe was due to my limited 1.5-2 years of experience.

How it went

My friend's experience:

Screening:

  1. aTOI: https://leetcode.com/problems/string-to-integer-atoi/description/ Please note you have to come up with integer overflow edge case yourself
  2. Left and right view of binary tree (thanks @Minmer!!!)

1st Onsite:

  1. This was not a tagged question - https://leetcode.com/problems/strobogrammatic-number-ii/
  2. Making a large island Interviewer praised for doing both questions (especially 2nd one) within timeframe - looked satisfied

2nd Onsite:

  1. https://leetcode.com/problems/maximum-swap/description/?envType=company&envId=facebook&favoriteSlug=facebook-all
  2. https://leetcode.com/problems/group-shifted-strings/description/ Solved both, interviewer seemed satisfied Interviewer was satisfied

Sys design:

  1. Design Leetcode Interviewer was satisfied - asked follow up questions

Behavioural:

  1. Standard conflict questions
  2. What if two imp projects together

Verdict: HR mentioned feedback was positive for all the rounds, although we are not able to find a role/team for you because of your experience.

I asked may i know how can i improve he did not mention anything. I think i have just 1.5-2 YOE that's why.

My tip would be whenever you are preparing for meta, please ensure you are covering all test cases - please make sure you learn edge cases by heart.

Questions asked (9)

  1. 01

    String to Integer (atoi)

    Data Structures & Algorithms

    Implement the myAtoi(string s) function, which converts a string to a 32-bit signed integer. Please note you have to come up with integer overflow edge case yourself.

    Open the problem
  2. 02

    Left and Right View of Binary Tree

    Data Structures & Algorithms

    Find the left and right view of a binary tree.

  3. 03

    Strobogrammatic Number II

    Data Structures & Algorithms

    Given an integer n, return all the strobogrammatic numbers that are of length n.

    Open the problem
  4. 04

    Making A Large Island

    Data Structures & Algorithms

    Given a binary matrix, you are allowed to change at most one 0 to 1. Return the size of the largest island in the matrix.

  5. 05

    Maximum Swap

    Data Structures & Algorithms

    Given a non-negative integer, you could swap two digits at most once to get the maximum possible number. Return the maximum possible number.

    Open the problem
  6. 06

    Group Shifted Strings

    Data Structures & Algorithms

    We can shift a string by shifting each of its letters to its successive letter. Given a list of strings, group all strings that belong to the same shifting sequence.

    Open the problem
  7. 07

    Design LeetCode

    System Design

    Design the LeetCode platform, including its core functionalities like problem creation, user submission, code execution, and leaderboards.

  8. 08

    Conflict Resolution

    Behavioral

    Standard questions about how I would handle conflicts with team members or stakeholders.

  9. 09

    Prioritizing Conflicting Projects

    Behavioral

    How would I manage a situation where I have two important projects due simultaneously or conflicting priorities?

How they prepared

My tip would be whenever you are preparing for meta, please ensure you are covering all test cases - please make sure you learn edge cases by heart.

Know someone preparing? Send it to them:WhatsAppLinkedInX

Interviewed at Meta recently?

Write up your rounds while you still remember the questions. It helps the next person more than you would think.

Share your experience
Discussion 0

Questions for the author, or how your own interview compared.

Join the discussion

Sign in with Google to comment or ask the author a question.

No comments yet

Be the first to share your thoughts and start the discussion!