Snowflake Interview Questions — Page 10

Snowflake·Data Scientist·Onsite - System Design / Architecture

Jun 2026

Snowflake data scientist interview that was basically one long ML system design case study on purchase prediction. Every sub-question peeled back another layer and by part D I was running out of steam. Dense but fair.

Design an end-to-end training and evaluation pipeline for a 7-day purchase classifier that avoids label leakage given a 10-day label delay. Specify your time-based cross-validation scheme including fold boundaries and feature/label windows.
Which offline metrics would you use for this imbalanced classifier, how would you calibrate the model's probabilities, and what formula would you use to pick a decision threshold that maximizes expected profit given the stated costs?
How would you detect and respond to distribution shift in both input features and model calibration over time? Describe the monitoring dashboard and any guardrails you'd put in place.
Given a 50ms p95 latency budget and 64MB RAM per request, what model architecture and featurization strategy would you choose for deployment, and what fallback rule would you use if the model is unavailable?
How would you explain this model and its threshold choice to a non-technical stakeholder, and what would you do if they pushed back and insisted on using a different threshold?

“This is where I spent the most time and also made the most mistakes early in my answer.”

View Post

Snowflake·Software Engineer·Technical Phone Screen

Jun 2026

Snowflake technical phone screen with a tree DP problem that sounds manageable until you realize there's a second optimization layer on top of the first. The kind of question where getting the basic structure right is only half the battle.

Given a rooted tree and an integer N, find the minimum number of node deletions (each deletion removes a node and its entire subtree) needed to cap the tree's maximum depth at N. Among all ways to achieve that minimum deletion count, find the one that maximizes the total depth of deleted nodes in the original tree. Return that maximum sum.

“The first part clicked pretty fast, standard subtree DP.”

View Post

Snowflake·Software Engineer·Technical Phone Screen

Jun 2026

One coding round for a software engineer role at Snowflake. Pretty standard grid traversal problem but the follow-up discussion on algorithmic choices made it more interesting than I expected.

Given an m x n binary matrix of 0s and 1s, find the minimum distance between a start cell and a target cell, where you can only move through cells containing 0.

“Went with BFS pretty much immediately since you want shortest path and DFS would've been a mess to reason about here.”

View Post

Snowflake·Software Engineer·Onsite - Coding / Algorithms

Jun 2026

Two coding problems back to back for a Snowflake SWE round. One graph problem, one tree traversal. Nothing too exotic but the boundary tree one had enough edge cases to slow me down.

Given n courses and a list of prerequisite pairs, return any valid ordering of all courses. If a cycle exists, return an empty list.
Given the root of a binary tree, return the boundary nodes in anti-clockwise order: root, left boundary (no leaves), all leaves left to right, then right boundary (no leaves) bottom-up.

“Classic topological sort.”

View Post

Snowflake·Software Engineer·Technical Phone Screen

Jun 2026

Snowflake coding screen, graph/topological sort territory. Pretty standard cycle detection problem but it's the kind of thing that trips you up if you haven't touched it recently.

Given a number of courses and a list of prerequisite pairs where each pair means one course must be completed before another, determine whether it's possible to finish all courses (i.e., detect if a cycle exists in the dependency graph).

“Classic topological sort / cycle detection.”

View Post

Snowflake·Software Engineer·Technical Phone Screen

Jun 2026

Snowflake software engineering interview that was pretty much all graph theory. The main problem took up most of the time and the follow-ups came fast once I had a working solution.

Given n tasks labeled 0 through n-1 and a list of prerequisite pairs where (a, b) means b must come before a, return any valid ordering that completes all tasks, or an empty list if no valid ordering exists. Walk through your algorithm, data structures, and how you detect cycles, then give the time and space complexity.
How would you identify all tasks that are part of at least one cycle?
How would your approach scale to 100,000 tasks and 200,000 prerequisite edges?

“This is topological sort and I knew that immediately, which felt good.”

View Post

Snowflake·Software Engineer·Technical Phone Screen

Jun 2026

Snowflake software engineer interview with a classic scheduling problem. The follow-up extensions were the real test, not the base question.

Given an array of meeting time intervals, find the minimum number of conference rooms needed so no two overlapping meetings share a room.

“Got the core solution down fine, min-heap sorted by end times, pretty standard.”

View Post

Snowflake·Software Engineer·Technical Phone Screen

Jun 2026

Snowflake software engineer interview with a graph traversal / privilege inheritance problem. Pretty clean problem statement but the transitive inheritance part is where things get interesting.

Given n roles each with directly assigned privileges, and a list of parent-child grant relationships forming a DAG, compute the complete set of privileges for every role after applying all transitive inheritance. Return deduplicated results per role.

“The base case is straightforward, just union the direct privileges.”

View Post

Snowflake·Data Scientist·Onsite - Behavioral / Leadership

Jun 2026

Snowflake data scientist interview with a behavioral question that was way more layered than it looked on the surface. The core of it was about reading between the lines when someone keeps rephrasing the same question at you.

Walk me through a time a stakeholder or interviewer kept circling back to the same question in different forms, apparently looking for a specific answer. Cover the context, how you figured out the real concern, how you adjusted your communication style, how you confirmed you'd actually addressed it, what you sacrificed under time pressure, and what the result was. What would you change next time?

“This one is sneaky because it's asking you to meta-reflect on a communication breakdown while also demonstrating you can do the thing it's asking about in real time.”

View Post

Snowflake·Backend Engineer·Technical Phone Screen

Jun 2026

Snowflake backend interview that leaned heavily on graph algorithms. The core problem was topological sort but they kept pushing into follow-ups that honestly caught me more off guard than the main question did.

Given a list of tasks with prerequisite dependencies, determine if all tasks can be completed without circular dependencies, and return a valid ordering if one exists.
How would you modify the approach to find the minimum number of parallel batches (semesters) needed to complete all tasks?
How would you produce the lexicographically smallest valid task ordering?
Given a dependency graph that contains exactly one cycle, how would you identify the single edge whose removal makes the graph a valid DAG?

“Kahn's algorithm, compute in-degrees, queue up the zeros, drain it.”

View Post