Companies
Amazon887 questions
Meta497 questions
Google393 questions
Uber311 questions
ByteDance / TikTok335 questions
Microsoft229 questions
Snowflake175 questions
Apple150 questions
Stripe195 questions
OpenAI177 questions
Databricks99 questions
Netflix88 questions
DoorDash119 questions
Roblox77 questions
IBM117 questions
Anthropic94 questions
Bloomberg107 questions
Coinbase87 questions
Capital One98 questions
LinkedIn96 questions
Goldman Sachs94 questions
Snapchat90 questions
Citadel / Citadel Securities85 questions
Salesforce85 questions
Rippling67 questions
JPMorgan Chase77 questions
Airbnb77 questions
Pinterest75 questions
Oracle70 questions
Waymo64 questions

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.
175
questions
Last updated
Before you start
Showing 69 of 69
OJ Problems
practice in the online judgeSort 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)Topological Sort for Course Schedule with Test CasesMinimum deletions to make tree height at most NDelete nodes from a tree to maximize remaining depthPropagate allow/disallow labels on a DAG and compute effective allowed set per nodeTree node path descriptionTree height after node removalMaximize credits by selecting coursesVerify Dish Recipes with Ingredient ListMaximize Profit from Queries in a Virtual WarehouseCourse Schedule with Batch Time Calculation设计内存文件系统
