← Back to Directory

Meta interview notes, page 187 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·Product Manager·Onsite - Product Sense / Strategy

Jun 2026
Meta PM interview, product sense round. Got asked to build something for sports, which sounds fun until you're actually sitting there trying to figure out which direction to go.
  • Design a product for the sports space. Walk through your thinking from user needs to final recommendation.

“I froze for a second trying to decide whether to go broad (fans, athletes, coaches) or just pick a lane fast.”

View Post

Meta·Data Scientist·Technical Phone Screen

Jun 2026
Meta DS interview with a product analytics case about whether a specific feature is hurting engagement. Pretty open-ended, which I wasn't fully prepared for.
  • A PM thinks the Re-share feature is hurting overall user engagement. How do you figure out if that's actually true, what metrics do you look at, and how do you design an experiment to test it?

“This question is broader than it looks.”

View Post

Meta·Data Scientist·Technical Phone Screen

Jun 2026
Meta data scientist screen, SQL-heavy with a focus on product metrics. Two related questions built on the same schema, which was a nice change from the usual disconnected problem dumps.
  • Given a video calls table and a users table, what percentage of users based in France made at least one video call the previous day?
  • Using the same tables, calculate the average time spent on video calls per daily active user in the United States for today.

“Straightforward join but I second-guessed whether to use the caller or recipient column to count a user as having 'made' a call.”

View Post

Meta·Software Engineer·Technical Phone Screen

Jun 2026
Meta SWE interview with a tree traversal problem. Pretty standard algorithmic round, nothing too wild, but the column-ordering constraint is where things get interesting if you're not careful.
  • Given the root of a binary tree, return the vertical order traversal of its node values from top to bottom, column by column, with nodes sharing the same row and column ordered left to right.

“The tricky part is handling ties correctly.”

View Post

Meta·Machine Learning Engineer·Technical Phone Screen

Jun 2026
Two coding problems at Meta for an MLE role. One was a compression plus dot product question, the other was a log parsing stack problem. Nothing behavioral, just back to back algorithms.
  • Design a run-length encoding scheme for integer vectors with many repeated consecutive values, then compute the dot product of two such vectors using only their compressed representations, without expanding them back out.
  • Given a list of function start and end log entries with timestamps on a single-threaded CPU, compute the exclusive execution time for each function, accounting for nested calls.

“The compression part was fine, I'd seen RLE before.”

View Post

Meta·Software Engineer·Technical Phone Screen

Jun 2026
Meta phone screen for a SWE role, basically a warm-up question on implementing fast exponentiation. Pretty standard stuff but there are a couple of gotchas that can trip you up if you haven't drilled it recently.
  • Implement pow(x, n) where n can be negative, and achieve O(log |n|) time complexity.

“The basic squaring logic isn't the hard part.”

View Post

Meta·Data Scientist·Technical Phone Screen

Jun 2026
Meta DS technical screen, one SQL question the whole time. Pretty focused on filtering and aggregation logic, nothing behavioral.
  • Given a table of post view events with a boolean flag for whether the viewer is connected to the post author, write a SQL query to find posts where the total view time from unconnected viewers in the last 7 days exceeds 60 seconds. Return post ID and total unconnected view seconds, ordered by that sum descending.

“Straightforward once you see it, but I spent a weirdly long time second-guessing the timestamp filter.”

View Post

Meta·Data Scientist·Technical Phone Screen

Jun 2026
SQL-heavy Data Scientist screen at Meta, four back-to-back analytical questions all built around the same schema. The whole thing felt like a take-home but live, which was stressful. Lots of edge cases baked in intentionally.
  • Given a schema with Users, Posts, PostHashtags, and Impressions tables, write a query to find the top hashtags by unique viewers over the last 7 days. Return the hashtag, unique viewer count, and rank, breaking ties deterministically. Use date functions instead of hardcoded dates.
  • For each hashtag in the last 7 days, compute the click-through rate defined as distinct users who clicked the hashtag divided by distinct users who were exposed to it. Make sure the denominator only counts exposures where that specific hashtag was present on the post, and avoid double-counting users who saw the same hashtag across multiple posts.
  • For each post created in the last 7 days, recommend up to 2 hashtags that its viewers clicked most in the last 30 days, excluding hashtags already on the post. Use a LEFT JOIN with IS NULL to handle the exclusion. Then explain exactly what rows would be lost if you swapped that LEFT JOIN for an INNER JOIN, paying special attention to posts with no hashtags at all and posts whose viewers never clicked anything.
  • Write a query to find posts that have zero hashtags but received more than one impression in the last 7 days. Explain why a RIGHT JOIN is unnecessary here and how a LEFT JOIN from Posts to PostHashtags lets you detect posts with no matching child rows.

“This one was more about window functions than anything else.”

View Post

Meta·Software Engineer·Technical Phone Screen

Jun 2026
Meta coding round focused on string manipulation with a real algorithmic twist. The palindrome question sounds easy until you actually have to return the index too, not just a boolean.
  • Given a string, can it become a palindrome by removing at most one character? Return both a true/false result and a valid index to delete. Walk through an O(n) solution and explain how you'd handle Unicode or case-insensitive comparisons.

“The two-pointer part came naturally but I completely forgot they also wanted the index back until I was halfway through explaining.”

View Post

Meta·Software Engineer·Onsite - Coding / Algorithms

Jun 2026
Four algorithm problems back to back at Meta for a software engineer role. Nothing behavioral, just pure coding the whole time. The problems ranged from pretty standard to genuinely annoying under pressure.
  • Given a string with non-negative integers, '+', and '*' operators (and optional spaces or commas), evaluate the expression respecting standard operator precedence (multiplication before addition), in O(n) time.
  • Given a sorted array of integers and a target value, return how many times the target appears. Must run in O(log n) time using binary search.
  • Given a sorted list of integers in [0, 99] that are present, output all missing values in that range as formatted strings: runs of 3 or more missing numbers as 'a->b', shorter runs listed individually as comma-separated values.
  • Find the minimum window substring of s that contains all characters of t with their required frequencies. Return an empty string if no such window exists. Target O(|s|) time with a sliding window approach.

“This one tripped me up more than it should have.”

View Post