Global · interview process

Meta

Meta typically runs an optional online assessment, a recruiter call, a 45-minute coding phone screen, then a roughly four-interview virtual loop of coding, design (mid-level and up) and a heavily weighted behavioural round, followed by team matching. Since late 2025 one coding round may be AI-assisted.

8 rounds
4-8 weeks (one guide says up to 12 for new grads)
3 design answers
3 coding answers
4 well-reported rounds

Start with round 1 Browse every question

0/6practised

OA
Screen
Screen
DSA
DSA
System design
Behavioural
HR
People rounds

The process, round by round

Reported by candidates and, where we found one, the company itself. Each round shows how well it is reported. Processes change by team, level and year.

1
Online assessment (CodeSignal)
Online assessment90 min for the staged format; 70 min for the four-question variant (same guide)
One report
A proctored test, usually one multi-stage practical problem whose parts unlock in order, with video and microphone monitoring. Reference tabs for syntax are allowed; AI tools and searching for solutions are not. One guide also reports four separate coding questions instead. One new-grad post labels its assessment technical plus behavioural but describes no behavioural questions.
- practical implementation
- handling added constraints
- performance
Varies: Not everyone gets one; the E3 guide says some candidates report it replacing the technical phone screen.
What can be asked in a online assessment round
A timed test on a coding platform, taken alone. Usually two or three coding problems, sometimes with multiple-choice questions on CS basics, aptitude or SQL.
- Array and string problems that need a hash map, two pointers or a sliding window
  Read the constraints first, because they point to the technique. If n is 100,000, an O(n^2) scan will time out, so look for a hash map, two pointers on a sorted array, or a window that moves forward only. Sketch the brute force, find the repeated work, then remove it. For two-sum style pairs you might say: I store each value's index as I scan, so the complement lookup is O(1) and the whole pass is O(n).
  DSA course →
- Greedy and sorting problems with a catch in the constraints
  Greedy problems hide behind a sort. Ask what ordering makes the locally best choice safe, then try to argue why swapping two adjacent choices never helps. Interval scheduling is the classic case: sort by end time and take every interval that starts after the last chosen one. Check the catch in the constraints, such as overflow, ties or equal values, and test a tiny case by hand before submitting.
  DSA course →
- A medium dynamic programming or graph-on-a-grid problem
  Decide whether the problem is a graph walk or a recurrence. On a grid, a shortest path with equal step cost is breadth-first search from the start, with a visited set so each cell is processed once, giving O(rows x cols). For dynamic programming, define the state in one sentence, write the transition, set the base cases, then see if only the previous row is needed to save space.
  DSA course →
- SQL queries with joins and group by
  Start from the table that holds the thing being counted, join the others on their keys, filter rows with WHERE, group, then filter groups with HAVING. Remember that WHERE runs before grouping and HAVING after. Use LEFT JOIN when rows with no match must still appear, and COUNT of a column rather than star when nulls matter. Example: customers with more than three orders is GROUP BY customer_id HAVING COUNT(*) > 3.
  Databases →
- Multiple-choice questions on OOP, operating systems, databases and networks
  These reward quick, accurate recall rather than long reasoning, so revise the short list of definitions that recur. Know the difference between a process and a thread, the four ACID properties, what an index trades for faster reads, TCP against UDP, and the four pillars of OOP. Eliminate two wrong options first, then choose. Do not spend more than a minute on any single question, and flag it to return to if time remains.
  Mock interviews →
Prepare with: Book · Online assessment DSA course
3 sources for this round
2
Recruiter screen
Recruiter or phone screen20-30 min
Prep guides
A conversation about your background, why Meta, target level and logistics (the E3 guide adds salary expectations). For mid-level and senior roles it is also where you choose a product or infrastructure track, which sets the type of design interview later.
- level fit
- communication
- motivation
Varies: Track choice applies to mid-level and senior candidates, the ones who get a design round.
What can be asked in a recruiter or phone screen round
A short call that decides whether you move on. Part resume and motivation, sometimes one easy coding or fundamentals question in a shared editor.
- Walk me through your resume and your best project
  Give a two minute spine, not a life story: who you are now, the one or two projects that matter most, and why this role is the next step. Pick the best project and state the problem, your part, the technology and one measurable result. Keep every claim something you can defend if the next question digs in. You could open with: I am a backend engineer, and the project I am proudest of is the one where I cut checkout latency.
  Screening call chapter →
- Why this company and why now
  The listener wants to know whether your reason is specific and sincere, not flattery. Name one or two real things about the product, the engineering problems or the team that you have looked at, then connect them to something you have done or want to learn. Why now should be about your growth, not escaping your current job. An opening could be: I have used the product, and the scaling problem it describes is the kind I want to work on.
  Screening call chapter →
- Notice period, location and compensation expectations
  Give the facts that are true and keep the negotiation for later. State your notice period exactly as your contract says, and mention whether it can be shortened or bought out only if that is real. For compensation, say you would like to understand the role and level first, or give a researched range rather than a single anchor. Never invent a current figure. If you are asked directly, answer honestly and calmly.
  HR and the number chapter →
- One easy or medium coding question, or a language fundamentals question
  Treat it as a short version of the full coding round. Repeat the problem back, ask about input size and edge cases, state a plan before typing, and talk while you code. For a language question, such as what a closure is or how a hash map handles collisions, give a one line definition and a tiny example. A good line is: first I will do the simple approach so we have something correct, then improve it.
  Tech phone screen chapter →
Prepare with: Book · Screening call Book · Tech phone screen
2 sources for this round
- Prep guide · 2026Hello Interview: Meta E4 guide ↗
- Prep guide · 2026TechScreen: Meta interview process 2026 ↗
3
Technical phone screen
Recruiter or phone screen45 min
Several reports
Live session in a shared editor (CoderPad in two guides) with a Meta engineer. Most candidates get two coding problems, though one guide says one or two. Code execution is disabled, so you trace examples by hand. One guide splits the time as about 5 minutes of introduction, 35 of coding and 5 for your questions.
- problem solving
- coding under a time limit
- self-testing without running code
What can be asked in a recruiter or phone screen round
A short call that decides whether you move on. Part resume and motivation, sometimes one easy coding or fundamentals question in a shared editor.
- Walk me through your resume and your best project
  Give a two minute spine, not a life story: who you are now, the one or two projects that matter most, and why this role is the next step. Pick the best project and state the problem, your part, the technology and one measurable result. Keep every claim something you can defend if the next question digs in. You could open with: I am a backend engineer, and the project I am proudest of is the one where I cut checkout latency.
  Screening call chapter →
- Why this company and why now
  The listener wants to know whether your reason is specific and sincere, not flattery. Name one or two real things about the product, the engineering problems or the team that you have looked at, then connect them to something you have done or want to learn. Why now should be about your growth, not escaping your current job. An opening could be: I have used the product, and the scaling problem it describes is the kind I want to work on.
  Screening call chapter →
- Notice period, location and compensation expectations
  Give the facts that are true and keep the negotiation for later. State your notice period exactly as your contract says, and mention whether it can be shortened or bought out only if that is real. For compensation, say you would like to understand the role and level first, or give a researched range rather than a single anchor. Never invent a current figure. If you are asked directly, answer honestly and calmly.
  HR and the number chapter →
- One easy or medium coding question, or a language fundamentals question
  Treat it as a short version of the full coding round. Repeat the problem back, ask about input size and edge cases, state a plan before typing, and talk while you code. For a language question, such as what a closure is or how a hash map handles collisions, give a one line definition and a tiny example. A good line is: first I will do the simple approach so we have something correct, then improve it.
  Tech phone screen chapter →
Prepare with: Book · Screening call Book · Tech phone screen
3 sources for this round
4
Onsite coding rounds
Data structures and algorithms45 min each
Several reports
Two coding rounds in most descriptions, each usually with two problems (one guide says one complex problem, and one E4 infrastructure report had a single problem per round). Reported topics are arrays, stacks and strings, trees and backtracking. Difficulty can exceed what the recruiter suggested; one E3 candidate was told to expect mediums and got a round labelled hard.
- algorithm fluency
- speed under pressure
- edge cases
- tracing your own code
Varies: Problem count per round varies between reports. One E3 candidate noted that all their interviewers had an infrastructure background while their own interests were web and app work.
Practise for this round
What can be asked in a data structures and algorithms round
A live coding round of 45 to 60 minutes with one or two problems. You are judged on how you clarify, reason, code, test and state the complexity, not on the answer alone.
- Arrays, strings and hashing: pairs, windows, frequency counts, prefix sums
  Name the pattern from the shape of the question. Pairs with a target use a hash map of seen values. A contiguous range with a condition uses a sliding window that grows on the right and shrinks on the left, so each element enters and leaves once, giving O(n). Range sums over many queries use a prefix sum array so each query is O(1) after O(n) setup. Count characters with a fixed-size array or map.
  DSA course →
- Linked lists, stacks and queues, including design-a-structure problems such as an LRU cache
  For an LRU cache, combine a hash map from key to node with a doubly linked list ordered by recency. Get moves the node to the front, put inserts at the front, and when over capacity you remove the tail node and its map entry. Both operations are O(1), and you say why: the map finds the node, the list reorders it without a scan. For stacks, mention a monotonic stack for next greater element.
  DSA course →
- Trees and BSTs, graphs (BFS, DFS, topological sort, shortest paths) and grids
  Decide the traversal from what is asked. Level by level or shortest path in an unweighted graph is BFS with a queue. Exploring all paths, components or cycles is DFS. A dependency order is topological sort: Kahn's algorithm repeatedly removes nodes with in-degree zero, and leftover nodes mean a cycle. Weighted shortest path with non-negative edges is Dijkstra with a heap, O((V + E) log V). On a BST, an in-order walk is sorted.
  DSA course →
- Heaps and top-K, intervals, binary search on the answer
  For the K largest items keep a min-heap of size K: push each element and pop the smallest when the heap exceeds K, so the cost is O(n log K) and memory is O(K). For intervals, sort by start, then merge by comparing the next start with the current end. For binary search on the answer, define a yes or no check that is monotonic, such as can ship within D days, and search the capacity range.
  DSA course →
- Dynamic programming from one dimension up to knapsack and string DP
  Define the state in a sentence, write the recurrence, fix the base cases, and decide the order of filling. Start with the recursive version with memoisation, then convert to a table. For 0/1 knapsack, dp[w] is the best value at capacity w, and in the one dimensional form you loop capacity downward so each item is used once. For string problems such as edit distance, the state is a pair of prefix lengths.
  DSA course →
- Follow-ups: optimise space, handle streaming input, make it thread-safe
  Treat follow-ups as a chance to show depth, and answer in the same calm order each time. To save space, ask which previous rows or values the recurrence actually reads and keep only those. For streaming input, say what summary you can keep, such as a heap of size K or a running count. For thread safety, name the shared state, guard it with a lock, and keep the critical section short.
Prepare with: Book · DSA round DSA course
4 sources for this round
5
AI-enabled coding round
Data structures and algorithms60 min
Prep guides
A pilot format that can replace one standard coding round: one extended task inside a multi-file project with a built-in AI assistant. Interviewers watch how you direct the assistant, verify what it produces and catch its mistakes.
- working in an existing codebase
- reviewing AI output
- debugging
- judgement on when to trust the tool
Varies: Described as a pilot, with one guide dating it to October 2025. It replaces one standard coding round in some loops, and the E3 guide says it is not guaranteed for E3.
What can be asked in a data structures and algorithms round
A live coding round of 45 to 60 minutes with one or two problems. You are judged on how you clarify, reason, code, test and state the complexity, not on the answer alone.
- Arrays, strings and hashing: pairs, windows, frequency counts, prefix sums
  Name the pattern from the shape of the question. Pairs with a target use a hash map of seen values. A contiguous range with a condition uses a sliding window that grows on the right and shrinks on the left, so each element enters and leaves once, giving O(n). Range sums over many queries use a prefix sum array so each query is O(1) after O(n) setup. Count characters with a fixed-size array or map.
  DSA course →
- Linked lists, stacks and queues, including design-a-structure problems such as an LRU cache
  For an LRU cache, combine a hash map from key to node with a doubly linked list ordered by recency. Get moves the node to the front, put inserts at the front, and when over capacity you remove the tail node and its map entry. Both operations are O(1), and you say why: the map finds the node, the list reorders it without a scan. For stacks, mention a monotonic stack for next greater element.
  DSA course →
- Trees and BSTs, graphs (BFS, DFS, topological sort, shortest paths) and grids
  Decide the traversal from what is asked. Level by level or shortest path in an unweighted graph is BFS with a queue. Exploring all paths, components or cycles is DFS. A dependency order is topological sort: Kahn's algorithm repeatedly removes nodes with in-degree zero, and leftover nodes mean a cycle. Weighted shortest path with non-negative edges is Dijkstra with a heap, O((V + E) log V). On a BST, an in-order walk is sorted.
  DSA course →
- Heaps and top-K, intervals, binary search on the answer
  For the K largest items keep a min-heap of size K: push each element and pop the smallest when the heap exceeds K, so the cost is O(n log K) and memory is O(K). For intervals, sort by start, then merge by comparing the next start with the current end. For binary search on the answer, define a yes or no check that is monotonic, such as can ship within D days, and search the capacity range.
  DSA course →
- Dynamic programming from one dimension up to knapsack and string DP
  Define the state in a sentence, write the recurrence, fix the base cases, and decide the order of filling. Start with the recursive version with memoisation, then convert to a table. For 0/1 knapsack, dp[w] is the best value at capacity w, and in the one dimensional form you loop capacity downward so each item is used once. For string problems such as edit distance, the state is a pair of prefix lengths.
  DSA course →
- Follow-ups: optimise space, handle streaming input, make it thread-safe
  Treat follow-ups as a chance to show depth, and answer in the same calm order each time. To save space, ask which previous rows or values the recurrence actually reads and keep only those. For streaming input, say what summary you can keep, such as a heap of size K or a running count. For thread safety, name the shared state, guard it with a lock, and keep the critical section short.
Prepare with: Book · DSA round DSA course
3 sources for this round
6
System design / product architecture
System design45 min
Several reports
One design interview, drawn in Excalidraw according to one guide. Candidates on the infrastructure track get a backend-focused system design question; product-track candidates get product architecture (APIs, data model, client-server flows). One 2025 E4 infrastructure report was a distributed counter covering Redis storage and heavy read and write traffic.
- navigating an open problem
- scalable design
- technical depth
- communication
Varies: Usually no design round for E3 new grads; one at E4; one or two at E5; two at E6+ (one guide). The E4 guide says weak design or behavioural performance can lead to down-levelling to E3.
Practise for this round
What can be asked in a system design round
A 45 to 60 minute discussion of how to build a system at scale: requirements, numbers, APIs, data model, components, bottlenecks and trade-offs.
- Short links, chat, news feed, notifications, search, rate limiting
  Use one repeatable path: clarify scope and scale, estimate load, define the API, sketch the data model, draw the main components, then probe bottlenecks. For short links, store a mapping from a generated short id to the long url, generate ids with a counter encoded in base 62, cache hot links, and note reads far outnumber writes. For chat, mention persistent connections and a store ordered per conversation.
  System design course →
- Payments, wallets and ledgers where money must never be lost or doubled
  Money systems put correctness before speed. Use a double-entry ledger where entries are append-only and every transfer writes a debit and an equal credit in one transaction. Protect against doubled charges with an idempotency key stored with the result, so a retry returns the original outcome. For lost updates use a database transaction, and reconcile with the payment provider's records on a schedule.
  System design course →
- Ride matching, maps and anything with live location
  Split the problem into location ingestion, a geospatial index and matching. Drivers send updates every few seconds to a write-optimised store, often in memory, keyed by a grid cell such as a geohash or S2 cell. To find nearby drivers, query the rider's cell and its neighbours, then rank by distance and estimated time. Say how you handle a stale location and a driver who accepts two rides.
  System design course →
- File storage and sync, video streaming and content delivery
  For file sync, split files into chunks, hash each chunk and upload only chunks the server lacks, so a small edit transfers a small amount. Keep metadata in a database and chunks in object storage. For video, upload the original, transcode into several resolutions, store segments and serve them through a content delivery network with adaptive bitrate streaming, so the player switches quality as bandwidth changes.
  System design course →
- Fundamentals: caching, sharding, replication, queues, consistency, failure handling
  Treat each as a tool with a cost. A cache cuts read latency but adds staleness and invalidation. Sharding spreads write load but makes cross-shard queries hard. Replication gives availability and read scale but introduces lag. Queues smooth spikes and decouple services but require idempotent consumers. For failures, name timeouts, retries with backoff and a fallback. State what you give up whenever you choose.
  System design course →
- Back-of-envelope estimates and what they decide
  Estimates are there to choose a design, so finish each one with a decision. Use round numbers: a day has about 100,000 seconds, so 10 million requests a day is roughly 100 per second on average, with a peak of a few times that. Multiply object size by count for storage, and compare against one machine's capacity. If one database handles the load, say so and avoid sharding.
  Capacity estimation →
Prepare with: Book · System design System design course
3 sources for this round
7
Behavioural round
Behavioural round45 min
Several reports
Questions about real past situations: conflict with a colleague, going beyond the brief, having your suggestions adopted, negative feedback, tight deadlines. The E4 guide expects four to six questions and advises preparing four or five detailed stories. The E3 guide also expects at least one question about using AI at work; the other guides do not mention this.
- ownership
- conflict resolution
- handling ambiguity
- growth mindset
- communication
Varies: The E3 guide contradicts itself on weight (coding carries most weight in one place, behavioural as much as coding in another); two guides say it strongly influences level at E4 and above. Its slot in the loop varies; one 2025 candidate had it right after the phone screen.
Practise for this round
What can be asked in a behavioural round round
Story-based questions about how you work. Prepare a few real stories you can reshape: the situation, your action and the result, with numbers where you have them.
- A conflict, a failure, a deadline you missed and what you changed
  Use situation, task, action and result, spending most of the time on what you did. For a failure, own your part, say what you learned and show a concrete change that you kept, such as a checklist or a test. For a conflict, show you listened and focused on the goal. The listener checks honesty and growth. Start plainly: the situation was a release that slipped, and my part in it was an estimate I did not revisit.
  Behavioural chapter →
- Leading without authority, mentoring, raising a hard issue
  The theme is influence without a title. Pick a real example where you persuaded others, taught a teammate or raised a risk early. Describe how you built agreement, with data, a small proof or a one page proposal, and what changed afterwards. Raising a hard issue means doing it early, privately where fitting, and with a suggested fix. Do not present someone else's work as your own.
  Behavioural chapter →
- Ambiguity: a time you had to decide with little information
  Interviewers check how you decide when facts are missing. Describe how you reduced the unknowns: asked who could answer, ran a small experiment, chose the reversible option, and set a point to review. Explain what you decided, what risk you accepted, and the outcome, including if it turned out wrong. A fitting opening: nobody could tell us the real traffic, so I proposed a two week trial before committing.
  Behavioural chapter →
- Customer or user focus, and an example of going beyond the brief
  Show that you understand who uses the work. Pick a real example where you looked at user feedback, support tickets or usage data and changed what you built, even when the ticket asked for something narrower. Describe the extra step you took, why it mattered to the user, and the result. The listener checks initiative and that it is grounded in evidence, not just effort.
  Leadership principles chapter →
Prepare with: Book · Behavioural Book · Leadership Principles
4 sources for this round
8
Team matching and offer
HR and offer
One report
After the loop you talk to prospective hiring managers before an offer is made, then discuss compensation and start date with the recruiter. Guides disagree on bootcamp: one says informal team conversations replaced the older bootcamp in 2023, while a 2026 guide says E3-E4 hires usually still do a multi-week bootcamp and then choose a team.
- team fit
- compensation negotiation
- start date
Varies: Per one guide, E5 and above are more often matched during or just after the process, sometimes before the offer is finalised.
Practise for this round
What can be asked in a hr and offer round
The closing conversation: motivation, expectations, notice period, compensation and how the offer is structured. Prepared answers and a clear number help here.
- Current and expected compensation, and how to answer without boxing yourself in
  Be honest and avoid giving a single number too early. Share your current pay only if you are comfortable, and make clear what is fixed and what is variable. For expectations, say you are flexible for the right role, and offer a researched range based on level and market. If pushed, state a figure you can justify. Never state a number you cannot support, because offers are often checked.
  HR and the number chapter →
- Notice period, joining date and relocation
  Give the facts exactly as they are in your contract. State the notice period, whether early release or a buy-out is truly possible, and the earliest honest joining date. Do not promise a date your employer has not agreed to. For relocation, say whether you can move, how soon, and whether you would need support. Clear, early information helps the recruiter plan and shows you are reliable.
  HR and the number chapter →
- Why you are leaving and what you are looking for
  Keep it positive and forward looking. Talk about what you want more of, such as larger scale, ownership or a stronger team, rather than criticising your current employer. The listener checks that you will not leave this job for the same reason. Opening line: I have learned a lot in the current role, and I now want to work on problems at a bigger scale.
- Levels, equity and how the offer is built
  Ask for the structure rather than only the total. Find out the level and title, base salary, bonus and whether it is guaranteed, equity amount, vesting schedule and cliff, joining bonus and any clawback. Compare offers on a yearly total with the same assumptions. If equity is in a private company, ask how it is valued and what happens on leaving. Asking calmly is normal and expected.
  Levels and equity chapter →
Prepare with: Book · HR & the number Book · Levels & equity
3 sources for this round

Preparing for the people rounds at Meta

The hiring manager, behavioural and offer conversations. Candidate reports shape the themes; the answers and frames are written for this site, so use them as a structure and bring your own stories.

What Meta says it valuesOfficial ↗

Move fastAct with urgency and remove blockers so everyone is moving in one direction.
Build awesome thingsAim for work that inspires people rather than work that is merely adequate.
Be direct and respect your colleaguesSpeak candidly and have tough conversations while staying respectful when you give feedback.
Focus on long-term impactChoose hard, lasting problems over quick wins, even when results take years.
Live in the futureShape how people will work, with an in-person focus, and adopt new products early.
Meta, Metamates, meTake responsibility for the company's success and look after your teammates.

Themes candidates report being probed

Resolving conflicts
Driving results
Embracing ambiguity
Growing continuously
Communicating effectively
Initiative beyond the brief
Negative feedback
Scope of impact decides level

Questions to rehearse

Tell me about a time you disagreed with a colleague at work and how it ended.Several reports
What is being checked. Reported by a candidate and a guide. The listener checks directness with respect, which matches the culture page, and whether you move the group forward.
How to frame it. State your concern with its evidence, how you raised it (in the open, with the person first), and how the team decided. Show the outcome even if you were wrong. Opening to adapt: "I thought [approach] would cause [problem], so I wrote up the trade-offs and we reviewed them together."
Worked example in the Interview book →Candidate write-up · 2025 ↗Prep guide ↗
Describe working with someone you found difficult.One report
What is being checked. Reported by an E3 London candidate. The listener checks emotional maturity and whether you adjusted your own approach rather than just endured them.
How to frame it. Describe the specific behaviour that blocked the work, not a label for the person. Say what you tried (a direct conversation, changing a process), and the result. Keep it fair to them. Opening to adapt: "[Colleague] often [behaviour] in reviews, so I asked for a short chat about how we could work better."
Candidate write-up · 2025 ↗
What is the most difficult feedback you have received, and what did you do with it?One report
What is being checked. Reported by an E3 London candidate. The listener checks whether you take feedback without defensiveness and show growth that is visible afterwards.
How to frame it. Quote the substance of the feedback, say how you first reacted honestly, then the specific change you made and any sign that it worked. Opening to adapt: "My lead told me [feedback], which stung, and over the next month I changed [habit]."
Candidate write-up · 2025 ↗
Tell me about a time you had very little time to finish something important.One report
What is being checked. Reported by an E3 London candidate. The listener checks prioritisation and execution speed, matching the move-fast value, and whether you communicated the trade-offs.
How to frame it. Say what the deadline was, what you cut and what you refused to cut, how you updated others, and what shipped. Include what you would do differently with more warning. Opening to adapt: "We had [short time] to deliver [thing], so I split it into [parts] and shipped the critical one first."
Candidate write-up · 2025 ↗
Give an example of exceeding what a task required.Several reports
What is being checked. Reported by an E4 candidate. The listener checks initiative and scope, which a guide says drive the level signal.
How to frame it. Describe what the task asked for, what you saw that was bigger, and how you widened the scope without losing the original delivery. State the measurable effect. Opening to adapt: "The ticket asked for [narrow thing], but I saw that [bigger problem], so I also [action]."
Candidate write-up · 2025 ↗Prep guide ↗
Tell me about a time other people adopted an idea of yours.One report
What is being checked. Reported by an E4 candidate. The listener checks influence: how you persuaded people who did not have to follow you, and whether you measured the result.
How to frame it. Explain the idea, who needed convincing, what you showed them (a prototype, numbers), and what happened after adoption. Credit others where due. Opening to adapt: "I proposed [idea] to [group] by showing [evidence], and it was adopted for [scope]."
Candidate write-up · 2025 ↗
Tell me about a project with unclear or changing requirements.Prep guides
What is being checked. A guide lists this with follow-ups on how you convinced the team and measured impact. The listener checks comfort with ambiguity and the scale of what you handled.
How to frame it. Describe how you pinned down what could be known, what you built first, how you communicated changes, and how you measured success. Expect follow-ups on numbers. Opening to adapt: "The requirements for [project] kept shifting, so I fixed [part] early and kept [part] flexible."
Prep guide ↗
Tell me about a time you chose a harder, longer-term fix over a quick win.Prep guides
What is being checked. Ties to the long-term impact value on the culture page. The listener checks judgement and whether you can justify patience with evidence.
How to frame it. Describe the quick option and its recurring cost, the longer-term option, and how you persuaded others to wait. State the eventual result honestly, including any delay it caused. Opening to adapt: "We could patch [problem] in a day, but it kept costing [time], so I proposed [lasting fix]."
Official ↗

The offer conversation

A guide says the behavioural round heavily influences level, and that weak behavioural or design performance can mean being offered E3 instead of E4, or a rejection.
A guide says Meta changed its process in 2023, so informal team conversations now happen before offers instead of the older bootcamp, and that matching can stretch the timeline if no team has an opening.
The same guide says offer negotiation comes after team matching. No first-hand compensation account was found.
General advice: ask which level is being offered and why, get the full breakdown in writing, and check notice period and buy-out before agreeing a date.

What we could not verify. Meta publishes its values but no interview criteria. Both first-hand reports are short, and the competency list and the level and team-matching claims come from a single guide site.

What we could not verify. Meta's careers prep page returned 404, so nothing is official. IGotAnOffer returned 403. The two Hello Interview guides are the same site, so the OA, team-matching and recruiter rounds lean on one vendor. The undated DEV new-grad post has no year. No candidate report described team matching or the offer call, and guides disagree on whether the bootcamp still exists. The AI-enabled round and the AI behavioural question come from guides only.

The process, round by round

Practise for this round

Practise for this round

Practise for this round

Practise for this round

Preparing for the people rounds at Meta

What Meta says it valuesOfficial ↗

Themes candidates report being probed

Questions to rehearse

The offer conversation