Snowflake
A small, bank-driven loop: a handful of coding families recur, and the follow-ups plus your own test cases decide a round more than the base problem does. Prompts often start on a blank page with no signature, so clarify, pick the interface and write the tests yourself. System design is infrastructure — a job scheduler, a key-value store, an ACL service — and the interviewer drills one mechanism until the hour ends.
Typical loop
- 1Recruiter screen: ~30 min — background, location, work authorization
- 2Some applicants: a ~20 min AI-conducted voice pre-screen on two projects, a conflict, and how you use AI tools
- 3Technical phone screen: two 45–60 min CoderPad rounds — usually both coding, sometimes one coding and one system design
- 4Onsite, often in person: three to four 60 min rounds — one or two coding, one system design, one behavioral; some loops add a project deep dive or an AI-augmented coding round
- 5Team matching: hiring-manager and teammate chats, still evaluative
Questions
Callback's practice questions and the LeetCode questions Snowflake has been asking, filtered together.
Asked on LeetCode
164 questions · all time
- Campus BikesmediumArraySortingHeap (Priority Queue)frequency 47.5
- Cheapest Flights Within K StopsmediumDynamic ProgrammingDepth-First SearchBreadth-First SearchGraph Theory+2frequency 47.5
- Count Nodes Equal to Average of SubtreemediumTreeDepth-First SearchBinary Treefrequency 47.5
- Design File SystemmediumHash TableStringDesignTriefrequency 47.5
- Graph Valid TreemediumDepth-First SearchBreadth-First SearchUnion-FindGraph Theoryfrequency 47.5
- Integer to English WordshardMathStringRecursionfrequency 47.5
- Keys and RoomsmediumDepth-First SearchBreadth-First SearchGraph Theoryfrequency 47.5
- Longest Univalue PathmediumTreeDepth-First SearchBinary TreeDP on Treesfrequency 47.5
- Making A Large IslandhardArrayDepth-First SearchBreadth-First SearchUnion-Find+1frequency 47.5
- Most Frequent IDsmediumArrayHash TableHeap (Priority Queue)Ordered Setfrequency 47.5
- Most Stones Removed with Same Row or ColumnmediumHash TableDepth-First SearchUnion-FindGraph Theory+1frequency 47.5
- Parallel Courses IIhardDynamic ProgrammingBit ManipulationGraph TheoryBitmask+1frequency 47.5
- Regular Expression MatchinghardStringDynamic ProgrammingRecursionfrequency 47.5
- Reverse Only LetterseasyTwo PointersStringfrequency 47.5
- Roman to IntegereasyHash TableMathStringfrequency 47.5
- Rotting OrangesmediumArrayBreadth-First SearchMatrixfrequency 47.5
- Add Two NumbersmediumLinked ListMathRecursionfrequency 38.4
- Alert Using Same Key-Card Three or More Times in a One Hour PeriodmediumArrayHash TableStringSortingfrequency 38.4
- Basic Calculator IImediumMathStringStackfrequency 38.4
- Best Time to Buy and Sell StockeasyArrayDynamic Programmingfrequency 38.4
- Binary Tree Inorder TraversaleasyStackTreeDepth-First SearchBinary Treefrequency 38.4
- Boats to Save PeoplemediumArrayTwo PointersGreedySorting+1frequency 38.4
- Construct Binary Tree from Preorder and Inorder TraversalmediumArrayHash TableDivide and ConquerTree+1frequency 38.4
- Construct Quad TreemediumArrayDivide and ConquerTreeMatrixfrequency 38.4
- Decode StringmediumStringStackRecursionfrequency 38.4
- Design Browser HistorymediumArrayLinked ListStackDesign+2frequency 38.4
- Design Circular DequemediumArrayLinked ListDesignQueuefrequency 38.4
- Design Circular QueuemediumArrayLinked ListDesignQueuefrequency 38.4
- Encode and Decode StringsmediumArrayStringDesignfrequency 38.4
- Find Median from Data StreamhardTwo PointersDesignSortingHeap (Priority Queue)+1frequency 38.4
- Height of Binary Tree After Subtree Removal QuerieshardArrayTreeDepth-First SearchBreadth-First Search+1frequency 38.4
- Implement Trie (Prefix Tree)mediumHash TableStringDesignTriefrequency 38.4
- Jump Game IImediumArrayDynamic ProgrammingGreedyfrequency 38.4
- Meeting Rooms IImediumArrayTwo PointersGreedySorting+2frequency 38.4
- Most Profitable Path in a TreemediumArrayTreeDepth-First SearchBreadth-First Search+1frequency 38.4
- My Calendar ImediumArrayBinary SearchDesignSegment Tree+1frequency 38.4
- N-Queens IIhardBacktrackingAlgorithm Xfrequency 38.4
- Number of IslandsmediumArrayDepth-First SearchBreadth-First SearchUnion-Find+1frequency 38.4
- Paint FencemediumDynamic Programmingfrequency 38.4
- Patching ArrayhardArrayGreedyfrequency 38.4
- Path With Minimum EffortmediumArrayBinary SearchDepth-First SearchBreadth-First Search+4frequency 38.4
- Populating Next Right Pointers in Each NodemediumLinked ListTreeDepth-First SearchBreadth-First Search+1frequency 38.4
- Populating Next Right Pointers in Each Node IImediumLinked ListTreeDepth-First SearchBreadth-First Search+1frequency 38.4
- Possible BipartitionmediumDepth-First SearchBreadth-First SearchUnion-FindGraph Theory+2frequency 38.4
- Remove K DigitsmediumStringStackGreedyMonotonic Stackfrequency 38.4
- Shortest BridgemediumArrayDepth-First SearchBreadth-First SearchMatrixfrequency 38.4
- Shortest Distance to a CharactereasyArrayTwo PointersStringfrequency 38.4
- Sort ColorsmediumArrayTwo PointersSortingQuicksort+1frequency 38.4
- The MazemediumArrayDepth-First SearchBreadth-First SearchMatrixfrequency 38.4
- Valid Word AbbreviationeasyTwo PointersStringfrequency 38.4