← Back to Directory

Snap interview notes, page 19 of 22

Large Enterprises

Most of these Snap write-ups come from Software Engineers (117), then Machine Learning Engineers (65) and Data Scientists (18). The most reported rounds are the technical phone screen (149), the system design round (45), the behavioral / leadership round (11) and the product sense round (8).

216 interview notes · updated Jul 2026

Snap·Data Scientist·Technical Phone Screen

Jun 2026
Snapchat data scientist interview with a heavy SQL and Python focus, all centered around a user events table. The questions were legitimately hard and the median calculation one in particular made me feel like I had no idea what I was doing for a solid minute.
  • Using a user_events table, write a SQL query to compute 7-day retention (inclusive) for users whose first visit was on 2023-04-01.
  • Write a SQL query returning the top 3 pages ranked by distinct purchasing users over the last month.
  • Find the median number of daily events per active user in April 2023 using SQL.
  • Given a Pandas DataFrame matching the user_events schema, write Python code to produce an hourly time-series of clicks per page for the past 24 hours.

“Went straight for a CTE to isolate first-visit users, then joined back on the same table filtering for events within 7 days.”

View Post

Snap·Machine Learning Engineer·Technical Phone Screen

Jun 2026
Snapchat ML Engineer interview with a deep project walkthrough. They really dig into one project and don't let you off easy with surface-level answers.
  • Walk me through a recent project you worked on in depth, including why it was done, what your role was, the technical decisions you made, problems you hit, and what the outcome was.

“This is the kind of question that sounds easy until you're actually in it.”

View Post

Snap·Software Engineer·Technical Phone Screen

Jun 2026
Snapchat software engineer interview with a linked list manipulation problem. Pretty straightforward on the surface but the edge case discussion took up more time than I expected.
  • Given two singly linked lists, interleave their nodes one at a time (first node of list 1, first of list 2, second of list 1, second of list 2, and so on). If one list is longer, append the remaining nodes at the end.

“I got the happy path pretty fast, two pointers walking both lists simultaneously, swap and advance.”

View Post

Snap·Software Engineer·Technical Phone Screen

Jun 2026
Snapchat SWE interview that leaned hard into backtracking. The main problem was a twist on a classic combination sum question, and the follow-up about handling duplicates is where things got interesting.
  • Given an array of integers and a target value, return all unique combinations that sum to the target. Each candidate can be reused any number of times. The twist: build your combinations by iterating from the end of the array toward the front instead of the usual left-to-right approach.
  • Follow-up: if the input array contains duplicates and each element can only be used once, how does the algorithm change? Specifically, how do you skip duplicate branches at the same level of recursion?

“I knew LC 39 well enough but the reversed traversal direction threw me off more than it should have.”

View Post

Snap·Product Manager·Onsite - Product Sense / Strategy

Jun 2026
Snap PM interview with a single policy/strategy question about TikTok. Not much to report beyond the question itself.
  • What should the United States government do about TikTok?

“Makes sense they'd ask this at Snap given the competitive angle, but I wasn't ready for it to be that blunt.”

View Post

Snap·Software Engineer·Technical Phone Screen

Jun 2026
Snapchat systems interview that went deep into numerical methods for trig functions, specifically how you'd take a working sin(x) and actually make it production-grade. More math-heavy than I expected for what I thought was a software engineering role.
  • You have a working sin(x) implementation written from scratch. Walk through how you would optimize it for production use, covering range reduction, polynomial approximation strategies, lookup tables, and SIMD vectorization. What are the trade-offs between speed, accuracy, and memory?

“This was the whole interview basically.”

View Post

Snap·Software Engineer·Technical Phone Screen

Jun 2026
Snapchat SWE interview with a graph theory problem. Pretty standard algorithmic round, nothing too surprising, but the cycle detection angle is worth thinking through carefully before you go in.
  • Given a number of courses and a list of prerequisite pairs, determine whether it's possible to complete all courses without getting stuck in a circular dependency.

“Basically a cycle detection problem dressed up as a scheduling question.”

View Post

Snap·Machine Learning Engineer·Technical Phone Screen

Jun 2026
Snapchat ML engineer interview with a classic puzzle-style coding problem that had a lot more depth than it looked. The follow-up questions pushed into edge cases and complexity analysis pretty hard.
  • You're given four numbers and a target value. Using addition, subtraction, multiplication, and division (with parentheses), and using each number exactly once, write a function that returns true if you can form an expression equal to the target. Follow-up: return a valid expression string if one exists. Also discuss division by zero handling, floating-point tolerance, your algorithmic approach, complexity, and how you'd extend this to N numbers or a different set of operators.

“I knew the backtracking approach going in but fumbled explaining the pruning part clearly.”

View Post

Snap·Data Scientist·Technical Phone Screen

Jun 2026
Snapchat data scientist interview with a meaty experiment design question centered on a spam filter rollout. The whole thing was one long multi-part problem and it went pretty deep into stats and causal inference territory.
  • You're launching a stricter spam filter and need to evaluate its effect on friend request dynamics. Walk through your full experiment design: hypotheses, randomization, metrics, power analysis, and how you'd handle incomplete spam labels.

“This was basically five questions in a trenchcoat.”

View Post

Snap·Machine Learning Engineer·Technical Phone Screen

Jun 2026
Snapchat ML engineer interview with a coding round that was pretty much a BFS grid problem. Nothing wild, but it's the kind of question that feels easy until you're actually writing it under pressure.
  • Given an n by n binary matrix, find the length of the shortest path from the top-left cell to the bottom-right cell, where you can move in all 8 directions and only through cells with value 0. Return -1 if no path exists.

“Classic BFS, and I knew it was BFS the moment I read it.”

View Post