Snowflake

Cloud data platform enabling data warehousing, data lakes, and data sharing.

4 Rounds ~21 Days Hard

Start Mock Interview

The Interview Loop

Recruiter Screen (30 min)

Standard fit check, behavioral questions, and resume overview.

Technical Loop (3-4 Rounds)

Deep dive into domain knowledge, coding, and system design.

Interview Question Bank

All Roles Cloud Engineer 1 Data Engineer 3 Data Scientist 2 Machine Learning Engineer 4 Software Engineer 4

All Topics System Design 16 Algorithms 14 SQL 9 Culture Fit 7 Leadership 6 ML System Design 3 Machine Learning 3 Concurrency 2

Cloud Engineer • Coding • medium

Given a list of IP CIDR blocks, write a function to merge all overlapping blocks and return the minimized list of CIDRs.

#Arrays #Networking #Intervals #Sorting

Practice

Data Engineer • Coding • medium

Implement a rate limiter in Python that allows a maximum of N requests per minute per user. The function should return True if the request is allowed, and False otherwise.

#Hash Maps #Queues #Concurrency #System Design Basics

Practice

Data Engineer • Coding • medium

Write a Python function to merge overlapping time intervals for user sessions. Given an array of intervals where intervals[i] = [start_i, end_i], merge all overlapping intervals and return an array of the non-overlapping intervals that cover all the intervals in the input.

#Arrays #Sorting #Intervals #Python

Practice

Data Engineer • Coding • hard

Given an array of daily stock prices, find the maximum profit you can achieve with at most two transactions. You may not engage in multiple transactions simultaneously (i.e., you must sell the stock before you buy again).

#Dynamic Programming #Arrays #State Machine

Practice

Data Scientist • Coding • easy

You are given a dataset containing JSON strings in a VARIANT column representing query execution metadata. Write a Python script using pandas to parse this JSON, extract the 'bytes_scanned' and 'execution_time_ms' fields, and identify queries that scan massive data but execute suspiciously fast.

#Data Parsing #JSON #Pandas

Practice

Data Scientist • Coding • medium

Write a Python function that takes a list of query execution intervals (start_time, end_time) for a specific compute warehouse and an auto-suspend threshold (in seconds). Calculate the total billed uptime, keeping in mind that the warehouse stays on for the auto-suspend duration after the last query finishes.

#Merge Intervals #Array Manipulation #Python

Practice

Machine Learning Engineer • Coding • medium

Given a list of log entries containing timestamps and user IDs, write a function to find the longest continuous session for each user. A session ends if there is a gap of more than 30 minutes.

#Sliding Window #Hash Maps #Time Series Data

Practice

Machine Learning Engineer • Coding • medium

Implement a Trie (Prefix Tree) to support fast autocomplete for SQL keywords and table names in a web-based query editor.

#Trie #String Manipulation #Search

Practice

Machine Learning Engineer • Coding • hard

Design a concurrent hash map from scratch that supports high-throughput read and write operations, typical of a distributed database environment.

#Concurrency #Data Structures #Multithreading #Locks

Practice

Machine Learning Engineer • Coding • hard

Given a list of words, a begin word, and an end word, find all shortest transformation sequences from the begin word to the end word. (Word Ladder II)

#Graphs #BFS #Backtracking

Practice

Software Engineer • Coding • medium

Given a list of materialized views and their dependencies on other views or base tables, write a function to determine a valid build order. If a circular dependency exists, detect and report it.

#Graph Theory #Topological Sort #Breadth-First Search

Practice

Software Engineer • Coding • hard

Implement a function that supports wildcard string matching with '?' and ''. '?' matches any single character, and '' matches any sequence of characters. Optimize it for large strings, simulating how a database engine might evaluate a complex LIKE clause.

#Dynamic Programming #String Manipulation #Greedy Algorithms

Practice

Software Engineer • Coding • hard

Write an algorithm to serialize and deserialize an N-ary tree. Assume this tree represents a SQL query execution plan where nodes are operators (Scan, Join, Filter) and edges are data flows.

#Trees #Serialization #Depth-First Search

Practice

Software Engineer • Coding • medium

Implement an algorithm to merge K sorted iterators. Assume this is part of an external sort operation where data exceeds available RAM, and you are merging sorted runs from disk.

#Heaps #Pointers #Sorting

Practice

Difficulty Radar

Based on recent AI-sourced data.

Meet Your Interviewers

The "Standard" Interviewer

Senior Engineer

Focuses on core competencies, system constraints, and clear communication.

Simulate

Unwritten Rules

Think Out Loud

Always explain your thought process before writing code or drawing architecture.

Practice Now

Snowflake

The Interview Loop

Recruiter Screen (30 min)

Technical Loop (3-4 Rounds)

Interview Question Bank

Given a list of IP CIDR blocks, write a function to merge all overlapping blocks and return the minimized list of CIDRs.

Implement a rate limiter in Python that allows a maximum of N requests per minute per user. The function should return True if the request is allowed, and False otherwise.

Write a Python function to merge overlapping time intervals for user sessions. Given an array of intervals where intervals[i] = [start_i, end_i], merge all overlapping intervals and return an array of the non-overlapping intervals that cover all the intervals in the input.

Given an array of daily stock prices, find the maximum profit you can achieve with at most two transactions. You may not engage in multiple transactions simultaneously (i.e., you must sell the stock before you buy again).

You are given a dataset containing JSON strings in a VARIANT column representing query execution metadata. Write a Python script using pandas to parse this JSON, extract the 'bytes_scanned' and 'execution_time_ms' fields, and identify queries that scan massive data but execute suspiciously fast.

Given a list of log entries containing timestamps and user IDs, write a function to find the longest continuous session for each user. A session ends if there is a gap of more than 30 minutes.

Implement a Trie (Prefix Tree) to support fast autocomplete for SQL keywords and table names in a web-based query editor.

Design a concurrent hash map from scratch that supports high-throughput read and write operations, typical of a distributed database environment.

Given a list of words, a begin word, and an end word, find all shortest transformation sequences from the begin word to the end word. (Word Ladder II)

Given a list of materialized views and their dependencies on other views or base tables, write a function to determine a valid build order. If a circular dependency exists, detect and report it.

Implement a function that supports wildcard string matching with '?' and '*'. '?' matches any single character, and '*' matches any sequence of characters. Optimize it for large strings, simulating how a database engine might evaluate a complex LIKE clause.

Write an algorithm to serialize and deserialize an N-ary tree. Assume this tree represents a SQL query execution plan where nodes are operators (Scan, Join, Filter) and edges are data flows.

Implement an algorithm to merge K sorted iterators. Assume this is part of an external sort operation where data exceeds available RAM, and you are merging sorted runs from disk.

Difficulty Radar

Meet Your Interviewers

The "Standard" Interviewer

Unwritten Rules

Implement a function that supports wildcard string matching with '?' and ''. '?' matches any single character, and '' matches any sequence of characters. Optimize it for large strings, simulating how a database engine might evaluate a complex LIKE clause.