← Back to Directory

Snowflake interview notes, page 8 of 14

Large Enterprises

Most of these Snowflake write-ups come from Software Engineers (118), then Data Scientists (12) and Backend Engineers (2). The most reported rounds are the technical phone screen (91), the system design round (30), the behavioral / leadership round (5) and the online assessment (2).

135 interview notes · updated Oct 2026

Snowflake·Software Engineer·Technical Phone Screen

May 2026
One coding round at Snowflake for a software engineer role. Pretty light on details but the follow-up question was the more interesting part.
  • Solve a binary search problem.
  • If you need to handle a large number of repeated queries on the same data, how would you avoid running binary search every single time?

“Standard stuff, nothing unexpected.”

View Post

Snowflake·Software Engineer·Technical Phone Screen

May 2026
Snowflake coding interview with a prefix-sum sliding window problem. Not the hardest thing I've seen but the constraint was a little tricky to get right under pressure.
  • Given an array and its prefix-sum array, find the length of the longest subarray (l, r) such that prefix[r] minus 2 times prefix[l] is at most k.

“The two-pointer setup clicked for me pretty fast, iterate l and push r as far right as it'll go while the condition holds.”

View Post

Snowflake·Software Engineer·Onsite - System Design / Architecture

May 2026
Snowflake SWE interview with a meaty system design question around building a KV store from scratch. The focus on ACID guarantees and concurrency made it more involved than your typical design round.
  • Design a key-value store that supports ACID properties and handles concurrent access correctly.

“This one sprawled fast.”

View Post

Snowflake·Software Engineer·Onsite - System Design / Architecture

May 2026
Snowflake system design round for a software engineer role. The whole thing was one long problem about building an async pipeline that ingests Jira bug tickets and feeds them to a slow AI agent that spits out PRs. Lot of moving parts and the interviewer kept pushing on edge cases.
  • Design an end-to-end system that continuously ingests Jira bug tickets, feeds them to a slow AI agent (30+ minutes per ticket) to generate PRs, tracks each ticket's state, and surfaces the resulting PRs to engineers for review.
  • How would you discover new Jira tickets: webhooks from Jira, or polling the API on an interval? What are the tradeoffs and can you rely on webhooks alone?
  • What is your data model for tracking each ticket's state through its full lifecycle, from discovery to PR opened?
  • A bad deploy fires 500 tickets in 5 minutes but you only have 10 agent slots. Walk through what the system does over the next few hours and how you keep the backlog bounded and observable.
  • A worker pulls a ticket, the AI agent runs for 25 minutes, then the worker pod is killed mid-job. How does the ticket get reprocessed without opening two PRs?
  • Engineers are complaining that the AI opens PRs for flaky tests that fix themselves. How would you add a flakiness detection gate without redesigning the whole pipeline?
  • If the AI agent's concurrency doubles, which components do you scale and what becomes the next bottleneck?
  • How should the system handle deduplication if the same bug is filed twice, or if a ticket is reopened after a PR was already generated?

“This is a big one.”

View Post

Snowflake·Software Engineer·Technical Phone Screen

May 2026
Snowflake SWE interview that went pretty deep into algorithms and graph theory, starting from a binary search problem on a structured log and spiraling into two graph traversal follow-ups on the same scenario. The whole thing felt like one long connected problem which was kind of cool but also exhausting.
  • Given a chronological log where entries are prefixed with [Info], [Warn], or [Error], and you know the first [Error] is always preceded by a [Warn] and all subsequent entries after the first [Error] are also [Error], find the 0-based index of the first [Error] entry using O(log n) comparisons. Explain your decision rule at the midpoint and prove correctness and complexity.
  • Given a directed service call graph where an edge A to B means A depends on B, and a single service s starts failing, failures propagate upstream to all callers. Find the complete set of services that will eventually be in error. Use BFS or DFS, specify your input/output format, and explain how you handle cycles and repeated visits.
  • On the same service call graph, starting from the initially failing service s, find one of the longest error propagation chains (a longest simple path starting from s). Use DFS, track the current path and best path seen so far, avoid revisiting nodes, and analyze the complexity and any assumptions needed for the problem to be tractable.

“The binary search setup is clean once you see it but I fumbled the decision rule explanation at first.”

View Post

Snowflake·Software Engineer·Technical Phone Screen

May 2026
Snowflake SWE interview with a tree traversal problem that looks easy until you think about the follow-up. The core question is straightforward but they pushed on optimization for repeated calls, which is where things got interesting.
  • Design and implement a class that models a royal family's line of succession. The class should support adding children to a parent, marking members as deceased, and returning the current inheritance order (depth-first preorder, skipping the dead). As a follow-up: how would you optimize repeated calls to the inheritance order query as the tree changes over time?

“The base problem is just a DFS with a dead-set filter, pretty mechanical.”

View Post

Snowflake·Software Engineer·Onsite - System Design / Architecture

May 2026
Snowflake system design round for a software engineer role. The whole thing was one big prompt about building a deduplication-aware object storage service, and they expected you to cover a lot of ground in one session.
  • Design a simplified cloud object storage service that supports file upload and download, with a focus on deduplication so that identical files are only stored once.
  • How would you handle deletion and garbage collection when multiple users share the same underlying file content?
  • What consistency and correctness concerns arise with partial or concurrent uploads, and how would you address them?

“This is a meaty one.”

View Post

Snowflake·Software Engineer·Online Assessment (OA)

May 2026
Took the Snowflake AIML Intern HackerRank OA after two weeks of frantic prep and genuinely low confidence in my DSA skills. Two questions, easier than I feared, though the platform itself caused some unnecessary stress.
  • Given an array of integers, you can perform up to k operations where each operation doubles any single element. Return the maximum possible bitwise OR of all elements after applying the operations.
  • Implement a Student class and a Result class that inherits from it. Result should store marks for three subjects, compute a percentage, and handle recheck requests. Pass mark is 33.33%.

“The key insight is that doubling is just a left shift, and to maximize OR you want to concentrate all k doublings on the largest element.”

View Post

Snowflake·Software Engineer·Technical Phone Screen

May 2026
Snowflake software engineer interview with a graph/scheduling problem that sounds straightforward until you realize they want you to handle the impossible case too. Pretty standard algorithmic round but they pushed on test case design which I wasn't fully ready for.
  • Given a list of courses and their prerequisites, return a valid order in which all courses can be completed. If no valid ordering exists, return an empty array.

“I jumped straight to BFS with in-degree tracking, which worked, but I fumbled a bit explaining why I return empty when there's a cycle.”

View Post

Snowflake·Software Engineer·Technical Phone Screen

May 2026
Snowflake software engineer interview with a coding question that looked easy on the surface but had a clean two-pointer trick behind it. Pretty straightforward round overall.
  • You're given a 1D array where each cell contains 0 (empty), 1 (person), or 2 (cake). Find the minimum distance between any person and any cake.

“I went with a two-pointer style single pass, left to right, tracking the last seen person or cake and updating a running minimum.”

View Post