← Back to Directory

Meta interview notes, page 209 of 238

FAANG / Big Tech

Most of these Meta write-ups come from Software Engineers (1,194), then Data Scientists (489) and Product Managers (453). The most reported rounds are the technical phone screen (1,190), the product sense round (466), the system design round (255) and the behavioral / leadership round (205).

2377 interview notes · updated Jul 2026

Meta·Software Engineer·Onsite - Behavioral / Leadership

Jun 2026
Behavioral round at Meta for a software engineer role. The whole thing centered on teamwork and how you hold up when things get stressful, with a heavy emphasis on real examples and actual numbers.
  • Can you walk me through specific examples of how you've helped unblock or support teammates, and how you generally collaborate across a team?
  • Tell me about a recent time you were under significant pressure at work, like a tight deadline or an incident, and how you kept performing through it.
  • How do you manage your own workload and commitments when teammates need your help?
  • For the examples you've shared, what were the outcomes and what did you actually change or learn from them afterward?

“I had two examples ready but fumbled the transition between them and ended up repeating myself.”

View Post

Meta·Software Engineer·Technical Phone Screen

Jun 2026
Did a coding round at Meta and got the classic linked list removal problem. Nothing too surprising but the two-pointer setup is one of those things you either have clean or you fumble under pressure.
  • Given the head of a linked list, remove the nth node from the end and return the updated head.

“Two pointers.”

View Post

Meta·Data Scientist·Technical Phone Screen

Jun 2026
Meta DS interview with a product metrics question that sounds deceptively simple but has a lot of moving parts once you actually dig in. The whole thing was a single meaty scenario about newsfeed engagement.
  • How would you define and measure an 'effective read' on a newsfeed, and what metrics, thresholds, and experiments would you use to confirm your definition actually captures real user value?

“I started with time-on-screen which felt obvious, then they pushed back asking how I'd distinguish someone who left the tab open versus someone who actually read.”

View Post

Meta·Machine Learning Engineer·Technical Phone Screen

Jun 2026
Meta ML Engineer interview with a tree problem that looks straightforward but has a few ways to trip you up if you're not careful about the base cases.
  • Given a binary tree and two nodes p and q, find their lowest common ancestor (the deepest node that has both as descendants, where a node can be its own descendant).

“Classic problem but I still fumbled the edge case where one of the nodes IS the ancestor.”

View Post

Meta·Software Engineer·Technical Phone Screen

Jun 2026
Meta software engineering interview with two coding problems back to back. Nothing too exotic but the tree BFS question had a follow-up on complexity that I fumbled a bit.
  • Given an array of positive integers and a target value, find the minimum length of a contiguous subarray whose sum is greater than or equal to the target. Return 0 if none exists. Expected O(n) time and O(1) space.
  • Given the root of a binary tree, return its level-order traversal as a list of lists, where each inner list contains the node values at that depth from left to right. Implement it iteratively using BFS and walk through the time and space complexity.

“Sliding window clicked pretty fast for me since the array is all positive integers, which means shrinking from the left always makes sense.”

View Post

Meta·Data Scientist·Onsite - Product Sense / Strategy

Jun 2026
A product strategy question for a Data Scientist role at Meta, framed as a full executive brief exercise. Dense, multi-part, and honestly more PM than DS. The kind of prompt that makes you wonder if you wandered into the wrong interview.
  • Meta is planning to launch a Europe-focused B2C customer-service chat tool for businesses, sold via monthly subscriptions. Write a one-page executive brief justifying building and launching this product now, covering: strategic alignment with Meta's EU vision, target segments and minimum viable use cases, the hardest EU-specific regulatory constraints and the trade-offs you'd make, three explicit goals and five non-goals for the first two quarters, a go/no-go decision framework if early metrics underperform, and how you'd communicate risks to skeptical stakeholders in Legal, Sales, and Privacy.

“This one hit me sideways.”

View Post

Meta·Product Manager·Onsite - Product Sense / Strategy

Jun 2026
Meta product sense round, one question about building a stock trading feature for Facebook. Pretty open-ended and I spent way too long on the 'why Facebook' part before actually getting into the product.
  • How would you design a stock trading product for Facebook?

“My first instinct was to jump straight into features and I had to stop myself.”

View Post

Meta·Software Engineer·Online Assessment (OA)

Jun 2026
Meta SWE online assessment, leveled coding problem around building an in-memory record store. Two levels: basic add/remove, then query by exact key and key prefix. Pretty straightforward if you're comfortable with dictionaries and string matching.
  • Implement an in-memory record store with add and remove operations, then extend it to support querying records by exact key match and by key prefix.

“The first two functions were basically just dictionary set and delete, no real trick there.”

View Post

Meta·Software Engineer·Onsite - System Design / Architecture

Jun 2026
Meta EM interview with a system design question focused on API design for Facebook Live commenting. Pretty lean on details but the core problem was meaty enough to chew on for a while.
  • Design the APIs for Facebook Live commenting.

“This one has more surface area than it looks.”

View Post

Meta·Software Engineer·Onsite - Coding / Algorithms

Jun 2026
Meta SWE coding round with a string manipulation problem that looks straightforward but has enough edge cases to trip you up if you're not careful about the minimality constraint.
  • Given an array of words, generate the shortest unique abbreviation for each word using the format: first letter + count of omitted middle characters + last letter. If words share the same abbreviation, extend the prefix until they diverge. If the abbreviation isn't shorter than the original word, just return the word itself.

“I got the basic abbreviation logic down pretty fast but the minimality part with colliding groups took me a while to untangle.”

View Post