← Back to Directory

Meta interview notes, page 161 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
Went through a technical screen for a Research Scientist role at Meta. The focus was on grid traversal and pathfinding, which felt pretty standard but had enough nuance in the follow-ups to keep me on my toes.
  • Given a 2D grid with a start cell and a destination cell, find a path from start to destination while avoiding walls. How do you approach this, and when would you choose BFS over DFS?

“I started with BFS because shortest path, but then fumbled a bit explaining why BFS guarantees it on an unweighted grid while DFS doesn't.”

View Post

Meta·Product Manager·Onsite - Product Sense / Strategy

Jun 2026
Meta product sense question, just the one prompt about recommending similar products on Amazon. Short and sparse on details but it's a meaty enough problem to chew on.
  • How would you design a 'recommended similar products' feature for Amazon?

“My first instinct was to jump straight into algorithms and collaborative filtering, which was probably the wrong move.”

View Post

Meta·Product Manager·Onsite - Product Sense / Strategy

Jun 2026
Product sense round at Meta for a PM role. One question, CEO framing, the kind that sounds open-ended but has a lot of hidden structure if you know where to look.
  • You are the CEO of a healthtech startup. What would you build?

“I spent the first minute just picking a problem space instead of grounding it in user needs, which I think hurt me.”

View Post

Meta·Software Engineer·Technical Phone Screen

Jun 2026
Meta data engineering interview focused almost entirely on a single SQL problem about modeling follow relationships. The question had enough layers that it took up most of the session, which I wasn't expecting.
  • Given a table of follow events with types like request, success, reject, and unfollow, write SQL to return the total number of currently active follow connections.
  • Extend your solution to return, for each calendar day, how many active follow connections existed at the end of that day.

“The tricky part is that 'active' isn't just whether a follow_success ever happened.”

View Post

Meta·Machine Learning Engineer·Technical Phone Screen

Jun 2026
Did a technical screen for an ML Engineer role at Meta and got a graph traversal problem on a 2D maze. Pretty standard stuff but the details matter more than you'd expect.
  • Given a 2D grid with walls and open cells, a start position, and a goal position, find a path from start to goal. Bonus: find the shortest path.

“I jumped straight to BFS without really explaining why, which I think cost me points.”

View Post

Meta·Product Manager·Onsite - Product Sense / Strategy

Jun 2026
PM interview at Meta with a product metrics question framed around a hypothetical Netflix scenario. Single question, product sense focus, not much else to go on from what I remember.
  • You're the PM for a podcast feature that launched six months ago. How do you define and measure whether it's been successful?

“I went straight to engagement metrics and kind of forgot to set up what success even means for a feature like this before diving in.”

View Post

Meta·Software Engineer·Technical Phone Screen

Jun 2026
Technical phone screen at Meta for a Software Engineer role. Two problems back to back, one array question and one tree question with a bunch of follow-ups tacked on. Not a brutal round but the follow-ups on the tree problem kept going longer than I expected.
  • Find the k-th largest element in an unsorted integer array. What's the most efficient approach, and can you avoid sorting the whole array?
  • Given a binary tree and two nodes, find their lowest common ancestor.
  • How does the LCA solution change if the tree is a binary search tree?
  • How would you find the LCA if each node has a pointer to its parent?
  • How would you approach finding the LCA if the tree is too large to fit in memory?

“Went with a min-heap of size k.”

View Post

Meta·Data Scientist·Technical Phone Screen

Jun 2026
SQL question for a Data Scientist role at Meta, pretty focused on aggregation logic with a join involved. Nothing too wild but the setup with two tables made it easy to overthink.
  • Given an Interactions table and a Products table, write a SQL query that returns each product along with its total interaction count summed across all buyers and sellers.

“My first instinct was to use COUNT(*) which would've been wrong since the interactions column already stores a pre-counted value.”

View Post

Meta·Machine Learning Engineer·Technical Phone Screen

Jun 2026
Coding round at Meta for an MLE role. One problem, grid manipulation, seemed straightforward but had a small gotcha that I almost missed.
  • Given a maze represented as a grid and a path as a list of (row, col) coordinates from entrance to exit, write a function that marks each cell along the path with '*', while keeping the entrance cell as 'e' and the exit cell as 'E'. Return the modified grid.

“Jumped straight into iterating the path and marking everything with '*', then realized mid-explanation I was about to overwrite the entrance and exit too.”

View Post

Meta·Software Engineer·Onsite - Coding / Algorithms

Jun 2026
Got a Meta SWE coding round with a bitmask/subset problem that looked deceptively clean on the surface. The constraint about duplicate letters within a word being auto-invalid is the kind of thing that trips you up if you're not careful.
  • Given a list of words, choose a subset where no two words share any letter, and maximize the total number of unique characters covered. Words with repeated letters internally are invalid. Return the maximum unique character count.

“The auto-disqualification of words with internal duplicate letters (like 'apple') is easy to miss if you jump straight to the subset logic.”

View Post