← Back to Directory

Meta interview notes, page 193 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·Technical Phone Screen

Jun 2026
Meta SWE coding round with one problem that looks straightforward until you realize the accumulation and filtering logic trips you up if you're not careful.
  • Implement a function that repeatedly calls an external get_story() API to collect at least 5 stories, accumulates rankings for duplicate story names, filters out stories below a given offset threshold, and returns the remaining stories sorted by ranking in descending order.

“The accumulation part is where I almost messed up.”

View Post

Meta·Software Engineer·Technical Phone Screen

Jun 2026
Meta SWE coding round, just one algorithmic problem the whole time. Pretty standard stuff if you've done any prep, but the details matter more than you'd think.
  • Given an array of points and a reference point P, find the K closest points to P.

“Knew the heap approach going in, but fumbled a bit explaining why a max-heap of size K beats sorting the whole array.”

View Post

Meta·Machine Learning Engineer·Technical Phone Screen

Jun 2026
Interviewed for an ML engineer role at Meta, got a coding question that looks deceptively simple on the surface but has a few edge cases that'll trip you up if you're not careful.
  • Given a string containing parentheses and possibly other characters, find the minimum number of parentheses that need to be added to make the string valid (fully balanced).

“I went straight to a stack-based approach and it worked fine, but I fumbled explaining why I was tracking unmatched opens separately from unmatched closes.”

View Post

Meta·Software Engineer·Technical Phone Screen

Jun 2026
Meta coding screen, one algorithmic problem, pretty straightforward once you see the pattern but I almost overcomplicated it.
  • You have an integer array. Repeatedly scan left to right, find the smallest non-zero element, and subtract it from every non-zero element. Each full pass is one operation. How many operations does it take until the array is all zeros?

“Spent way too long simulating the actual process in my head before realizing you just need to count distinct non-zero values.”

View Post

Meta·Technical Program Manager·Onsite - Product Sense / Strategy

Jun 2026
TPM interview at Meta with a product design question about building a music streaming service for Facebook. Pretty open-ended, which I wasn't fully prepared for.
  • How would you design a music streaming service for Facebook?

“I went straight to user segmentation and started listing features, which in retrospect was probably the wrong entry point.”

View Post

Meta·Software Engineer·Technical Phone Screen

Jun 2026
Meta SWE coding round, one algorithmic question about finding the Kth largest element in an array. Pretty focused session, no fluff.
  • Given an array of integers and a value K, find the Kth largest element efficiently. What data structure would you use and why?

“My first instinct was to sort it and index from the end, which works but they pushed back on complexity pretty fast.”

View Post

Meta·Software Engineer·Online Assessment (OA)

Jun 2026
Meta SWE coding question involving a simple ratio calculation across two arrays. Nothing too wild but the edge case handling is where you can trip up.
  • Given two arrays of prices and ratings, compute a ratio (rating divided by price) for each product and return the index of the product with the highest ratio. Ties go to the smaller index.

“Pretty straightforward once you see it.”

View Post

Meta·Software Engineer·Onsite - System Design / Architecture

Jun 2026
Meta system design round for an EM role. One question, big scope, lots of moving parts. The chess angle felt like a curveball but it's really just a real-time multiplayer problem dressed up.
  • Design an online Chess platform that is fast, reliable, and can handle 100 million monthly active users each playing roughly one game per week.

“The chess framing threw me a bit at first because I started thinking about game logic before I thought about scale.”

View Post

Meta·Software Engineer·Technical Phone Screen

Jun 2026
Meta coding round, one question, grid traversal. Not the hardest problem on paper but I definitely fumbled the edge cases under pressure.
  • Given a 2D grid of characters and a target word, determine whether the word can be found by moving through adjacent cells (up, down, left, right) without reusing any cell.

“I knew this was backtracking pretty fast, but my first pass had a bug where I wasn't properly resetting the visited state after backtracking.”

View Post

Meta·Software Engineer·Onsite - Behavioral / Leadership

Jun 2026
Interviewed for a chief-of-staff role at Meta, just the one behavioral question from what I can tell. Pretty standard stuff but it still made me think harder than I expected.
  • Describe a situation where you stepped in to help someone who needed support.

“I went with a work example about a teammate who was drowning before a big deadline.”

View Post