← Back to Directory

Meta interview notes, page 140 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 focused on a launch scenario. Just the one question but it went pretty deep pretty fast.
  • You're two weeks out from launching Facebook Jobs. What metrics would you use to measure whether the launch is successful?

“I started with the obvious stuff, job postings created, applications submitted, and they just kind of waited.”

View Post

Meta·Software Engineer·Onsite - Coding / Algorithms

Jun 2026
Meta SWE coding round, one problem the whole session. The question looks deceptively simple until you read the constraint about not building the full strings first.
  • Given two singly linked lists where each node holds a string, determine whether the full concatenation of the first list equals the full concatenation of the second list. You cannot build the complete strings before comparing; you have to do it incrementally. Target O(total characters) time.

“My first instinct was to just join everything and compare, which is exactly what the constraint rules out.”

View Post

Meta·Software Engineer·Technical Phone Screen

Jun 2026
Meta SWE interview with a linked list question that looks trivial until you actually sit down and think through all the edge cases.
  • You're given two singly linked lists where each node holds a single character. Write a function that returns true if both lists represent the same string, false otherwise.

“Seemed easy at first glance.”

View Post

Meta·Software Engineer·Online Assessment (OA)

Jun 2026
Meta coding screen, the multi-level in-memory database design kind. Four progressively nastier levels, each one building on the last, and by the time TTLs and snapshots showed up I was definitely sweating.
  • Build an in-memory database that supports SET, GET, and DELETE operations on records identified by a key and a field.
  • Extend the database to support SET_AT and SET_AT_WITH_TTL, where each field can have a per-field expiry timestamp, and reads after expiry should return nothing.
  • Add SCAN and SCAN_BY_PREFIX operations that return all matching fields for a given key, sorted in lexicographic order, with prefix filtering as an option.
  • Implement BACKUP(timestamp) and RESTORE operations so the entire database state can be snapshotted at a given timestamp and later restored, with TTLs adjusted relative to the restore time rather than the original set time.

“Straightforward enough.”

View Post

Meta·Software Engineer·Technical Phone Screen

Jun 2026
Meta coding interview, tree problem, pretty standard stuff but the cousin traversal angle tripped me up more than I expected.
  • Given a binary tree and a target node, print all cousin nodes of that node.

“I knew the definition of cousins (same depth, different parent) but translating that into clean code took me longer than it should have.”

View Post

Meta·Software Engineer·Technical Phone Screen

Jun 2026
Meta Data Engineer coding screen with three Python problems, all library/book themed which felt a bit on the nose. Nothing too brutal but the log validation one had an edge case that I almost missed.
  • Given a list of (category, points) pairs representing books, select up to 3 books where each book must be from a different category, and return the maximum total points achievable.
  • Given a dictionary mapping library locations to lists of people, and a set of closed locations, return a new dictionary with only the open locations and their associated people.
  • Given an ordered list of log entries as (book_id, action) tuples where action is either 'checkout' or 'return', validate the sequence and return False if any book is checked out twice without a return in between, or returned when it was never checked out.

“This is basically a constrained selection problem.”

View Post

Meta·Data Scientist·Technical Phone Screen

Jun 2026
Meta DS interview focused entirely on a product analytics case around the Memories feature. Four questions, all connected, building on each other in a way that felt more like a live product review than a standard interview loop.
  • Walk me through how you would build a framework to evaluate the performance of the Memories feature.
  • If Memories is seeing a 20% click-through rate, is that good? How would you benchmark it?
  • Is total time-spent a reliable metric for measuring Memories' impact?
  • A post from 2019 was resurfaced in 2020. How do you make sure it doesn't get shown again in 2021?

“I started with CTR and immediately sensed that wasn't going to be enough.”

View Post

Meta·Software Engineer·Technical Phone Screen

Jun 2026
Meta SWE interview that went deep on tree manipulation, specifically converting a BST to a doubly linked list in-place. They wanted both recursive and iterative approaches plus complexity analysis, and the follow-ups were where things got spicy.
  • Convert a binary search tree into a sorted doubly linked list in-place, reusing tree nodes so that left becomes prev and right becomes next. Return the head of the list. Also explain how you handle duplicate keys.
  • Modify your solution to produce a circular doubly linked list instead of a linear one.
  • If recursion is not allowed, how do you achieve O(1) auxiliary space beyond the output pointers? Walk through Morris traversal as a solution.

“I went with the recursive in-order approach first, threading a 'prev' pointer through the traversal.”

View Post

Meta·Software Engineer·Technical Phone Screen

Jun 2026
Phone screen for a software engineer role at Meta, just one coding question with a twist on a classic LC problem. Short and to the point.
  • Implement a function to determine whether a given string is a valid number, with some modifications to the standard problem definition.

“The 'variation from the original' part is what gets you.”

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 standard but they pushed on edge cases harder than I expected.
  • Given an unsorted array (which may include duplicates and negative numbers, up to 10^5 elements), find the kth largest element. Walk through your algorithm, analyze the time complexity, and provide at least three test cases. Also handle the case where k exceeds the array length.

“I went with a min-heap of size k, which gets you O(n log k) and I felt pretty good about that.”

View Post