← Back to Directory

Snowflake

Large Enterprises

Most of these Snowflake write-ups come from Software Engineers (65), then Backend Engineers (2) and Frontend Engineers (2). The most reported rounds are the technical phone screen (55), the system design round (10), the online assessment (1) and the behavioral / leadership round (1).

69 interview notes · updated Jun 2026

Snowflake·Software Engineer·Online Assessment (OA)

Jun 2026
Snowflake coding screen, one question, pretty math-heavy for what felt like a warmup problem. Walked out not totally sure if I'd nailed the formula or just gotten lucky.
  • Given Q queries, each with a (rows, cols) pair, compute for each query the count of cells on or above the main diagonal of a min(rows, cols) by min(rows, cols) sub-rectangle.

“The key is recognizing you only care about the smaller dimension.”

View Post

Snowflake·Software Engineer·Technical Phone Screen

Jun 2026
Snowflake SWE interview with a coding question on array traversal. Pretty focused session, nothing too wild, but the problem had a neat trick to it.
  • Given a 1D array where each element is 0 (empty), 1 (person), or 2 (cake), find the minimum distance between any person and any cake.

“The two-pointer approach clicked pretty fast for me.”

View Post

Snowflake·Software Engineer·Technical Phone Screen

Jun 2026
Snowflake software engineer interview with a greedy optimization problem that sounds deceptively simple but has a few edge cases worth thinking through carefully.
  • You manage a virtual data warehouse with n query types, each having a fixed runtime and a revenue per execution. Given a total time budget of K minutes and the constraint that you must pick exactly one query type to run repeatedly, find the query type and total revenue that maximizes earnings within the time budget.

“My first instinct was to overcomplicate it.”

View Post

Snowflake·Software Engineer·Technical Phone Screen

Jun 2026
Snowflake coding interview with a tricky subarray problem that looks deceptively simple until you realize the constraint isn't a standard subarray sum. The sliding window approach works but you have to think carefully about why it's valid here.
  • Given an array with a precomputed prefix-sum array and an integer k, find the length of the longest subarray (l, r) such that prefix[r] minus 2 times prefix[l] is at most k.

“The constraint tripped me up at first because it's not the usual subarray sum question.”

View Post

Snowflake·Software Engineer·Technical Phone Screen

Jun 2026
Snowflake SWE interview with a tree boundary problem that looked straightforward until the edge cases started piling up. The follow-up extensions kept coming, which I wasn't fully prepared for.
  • Given the root of a binary tree, compute the sum of values along the left boundary, the right boundary, and all leaf nodes, without double-counting any node.
  • Extend your solution to return the actual node values in boundary order, handle very deep trees iteratively, or generalize the approach to k-ary trees.

“The core idea clicked pretty fast since I'd seen LC 545 before.”

View Post

Snowflake·Software Engineer·Technical Phone Screen

Jun 2026
Snowflake software engineer coding round, just one question but they pushed on optimization. Started with a naive solution and had to work up to constant space before they seemed satisfied.
  • Implement a solution to determine whether a given number is a 'happy number'.

“Got the linear space version out pretty quickly, cycle detection with a set.”

View Post

Snowflake·Backend Engineer·Technical Phone Screen

Jun 2026
Snowflake backend interview centered almost entirely on graph problems. The core question was a topological sort variant and they kept pushing with follow-ups that got progressively trickier. Not a bad experience but I definitely underestimated how deep they'd go on a single topic.
  • Given a list of tasks labeled 0 to n-1 and prerequisite pairs indicating dependencies, can all tasks be completed without a cyclic dependency? If yes, produce a valid ordering.
  • What is the minimum number of parallel batches (or semesters) needed to complete all tasks, assuming tasks with no remaining dependencies can run simultaneously?
  • How would you modify the approach to return the lexicographically smallest valid ordering?
  • Given a directed graph that contains exactly one cycle, how would you find the single edge whose removal makes the graph a valid DAG?

“Classic topological sort.”

View Post

Snowflake·Software Engineer·Onsite - System Design / Architecture

Jun 2026
Snowflake software engineering interview that centered on a classic systems design problem. The depth they expected was pretty serious, lots of follow-ups stacked on top of each other.
  • Design and implement an in-memory key-value store with set, get, and delete operations. How would you extend it to support TTL-based expiration, versioning with snapshot and rollback, transactions, LRU tracking, and thread-safe access?

“Started with a hashmap, which is the obvious answer, and they nodded along.”

View Post

Snowflake·Software Engineer·Technical Phone Screen

Jun 2026
One round at Snowflake for a software engineer role, pretty straightforward coding interview with a binary search problem and a follow-up about query optimization.
  • Solve a binary search problem.
  • How would you optimize your solution if there are many repeated queries, so you're not running binary search from scratch every time?

“Standard stuff, nothing tricky.”

View Post

Snowflake·Software Engineer·Technical Phone Screen

Jun 2026
Snowflake coding round, got a graph/scheduling problem that looked like a topological sort question but had this extra batch-timing twist I wasn't fully ready for.
  • You have a set of courses with prerequisites forming a directed graph, and each course has a completion time. Courses with all prerequisites met can run in parallel as a batch, but you must wait for the entire batch to finish before starting the next one. The time per batch is the max course time in that batch. Return the total time to finish all courses, or -1 if there's a cycle.

“I got the topological sort part pretty quickly, BFS with in-degree tracking, standard stuff.”

View Post

Snowflake interview FAQ

What rounds are in the Snowflake interview?

Candidates most often report a technical phone screen (55 write-ups), a system design round (10), an online assessment (1) and a behavioral / leadership round (1).

What does the Snowflake technical phone screen cover?

Across 55 technical phone screen write-ups, the most tagged question topics are Algorithms & Data Structures (62 questions), Technical Trade-offs (32) and System Design (13).

What is asked in the Snowflake system design round?

Across 10 system design write-ups, the most tagged question topics are System Design (17 questions), Technical Trade-offs (15) and Algorithms & Data Structures (6).