Snowflake Interview Question Bank
Snowflake's loop is small and bank-driven: a recruiter screen, two back-to-back coding phone screens, then a virtual onsite that mixes coding, system design, and behavioral. The same handful of coding families (multi-source BFS on a grid, course-schedule variants, tree-node-deletion height problems, transactional KV stores) cycle through most candidates, so recognition speed matters more than novel problem solving.
190
questions
Last updated
Before you start
Showing 73 of 73
OJ Problems
practice in the online judgeBounded Event Stream Unique-Key QueriesImplement a React Kanban Board with Ordered Task MovesParallel Courses IIISliding Window Rate LimiterAsynchronous Distributed Tree Count AggregationPrune an N-ary Tree to a Maximum DepthDesign a Concurrent Rate Limiter with Deferred RequestsWiki Hopper: Crawl All Reachable PagesThree-Colorability of an Undirected GraphRewrite Tree with Subtree SumsShortest Distance to Target CharacterSort Colors in a RecordCollection In-PlaceDelete a Node from a Forest Represented by Parent Index ArrayImplement a JSON ParserDistance from Each 1 to the Nearest 2 in an ArrayShortest Path in a Binary Matrix with ObstaclesHappy NumberMaximum Number of Events That Can Be Attended IIConnect Four Can Play WinParallel Courses IIIHandle Intervals When Input Is Not SortedRoot Equals Average of All SubtreesDelete Nodes in an N-ary Tree with Children Reattached; Compute Resulting HeightNearest Bathroom Distance for Each Desk in a Grid (Multi-source BFS)Max Height of a Tree Skipping Deleted Nodes + Minimum Deletions to Keep Height ≤ KNearest Bathroom Distance for Each Desk in a GridMinimum Coins to Pay with Overpay and Change AllowedTop-K trending search terms with per-user de-duplicationLeetCode 1600/1610 (uncertain) with follow-upBoundary Traversal of a Full Complete Balanced Binary Tree (Variant)