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
- 3SummediumArrayTwo PointersSortingfrequency 20.0
- Alien DictionaryhardArrayStringDepth-First SearchBreadth-First Search+3frequency 20.0
- Binary Tree Level Order TraversalmediumTreeBreadth-First SearchBinary Treefrequency 20.0
- Binary Tree Maximum Path SumhardDynamic ProgrammingTreeDepth-First SearchBinary Tree+1frequency 20.0
- Check if an Original String Exists Given Two Encoded StringshardStringDynamic Programmingfrequency 20.0
- Climbing StairseasyMathDynamic ProgrammingMemoizationfrequency 20.0
- Clone GraphmediumHash TableDepth-First SearchBreadth-First SearchGraph Theoryfrequency 20.0
- Coin ChangemediumArrayDynamic ProgrammingBreadth-First SearchKnapsack Problem+1frequency 20.0
- Combination Sum IVmediumArrayDynamic Programmingfrequency 20.0
- Container With Most WatermediumArrayTwo PointersGreedyfrequency 20.0
- Contains DuplicateeasyArrayHash TableSortingfrequency 20.0
- Counting BitseasyDynamic ProgrammingBit Manipulationfrequency 20.0
- Decode WaysmediumStringDynamic Programmingfrequency 20.0
- Find Minimum in Rotated Sorted ArraymediumArrayBinary Searchfrequency 20.0
- Grid GamemediumArrayMatrixPrefix Sumfrequency 20.0
- Group AnagramsmediumArrayHash TableStringSortingfrequency 20.0
- House RobbermediumArrayDynamic Programmingfrequency 20.0
- House Robber IImediumArrayDynamic Programmingfrequency 20.0
- Insert IntervalmediumArrayfrequency 20.0
- Invert Binary TreeeasyTreeDepth-First SearchBreadth-First SearchBinary Treefrequency 20.0
- Jump GamemediumArrayDynamic ProgrammingGreedyfrequency 20.0
- Kth Smallest Element in a BSTmediumTreeDepth-First SearchBinary Search TreeBinary Treefrequency 20.0
- Linked List CycleeasyHash TableLinked ListTwo PointersFloyd's Cycle Finding Algorithmfrequency 20.0
- Longest Common SubsequencemediumStringDynamic ProgrammingLongest Common Subsequencefrequency 20.0
- Longest Consecutive SequencemediumArrayHash TableUnion-Findfrequency 20.0
- Longest Increasing SubsequencemediumArrayBinary SearchDynamic ProgrammingLongest Increasing Subsequencefrequency 20.0
- Longest Palindromic SubstringmediumTwo PointersStringDynamic ProgrammingManacherfrequency 20.0
- Longest Repeating Character ReplacementmediumHash TableStringSliding Windowfrequency 20.0
- Longest Substring Without Repeating CharactersmediumHash TableStringSliding Windowfrequency 20.0
- Lowest Common Ancestor of a Binary Search TreemediumTreeDepth-First SearchBinary Search TreeBinary Tree+2frequency 20.0
- Maximum Depth of Binary TreeeasyTreeDepth-First SearchBreadth-First SearchBinary Treefrequency 20.0
- Maximum Product SubarraymediumArrayDynamic Programmingfrequency 20.0
- Maximum SubarraymediumArrayDivide and ConquerDynamic Programmingfrequency 20.0
- Maximum Width of Binary TreemediumTreeDepth-First SearchBreadth-First SearchBinary Treefrequency 20.0
- Meeting RoomseasyArraySortingQuicksortfrequency 20.0
- Merge IntervalsmediumArraySortingQuicksortfrequency 20.0
- Missing NumbereasyArrayHash TableMathBinary Search+2frequency 20.0
- N-QueenshardArrayBacktrackingAlgorithm Xfrequency 20.0
- Non-overlapping IntervalsmediumArrayDynamic ProgrammingGreedySortingfrequency 20.0
- Number of 1 BitseasyDivide and ConquerBit Manipulationfrequency 20.0
- Number of Connected Components in an Undirected GraphmediumDepth-First SearchBreadth-First SearchUnion-FindGraph Theoryfrequency 20.0
- Pacific Atlantic Water FlowmediumArrayDepth-First SearchBreadth-First SearchMatrixfrequency 20.0
- Palindromic SubstringsmediumTwo PointersStringDynamic Programmingfrequency 20.0
- Product of Array Except SelfmediumArrayPrefix Sumfrequency 20.0
- Remove Nth Node From End of ListmediumLinked ListTwo Pointersfrequency 20.0
- Reorder ListmediumLinked ListTwo PointersStackRecursionfrequency 20.0
- Reverse BitseasyDivide and ConquerBit Manipulationfrequency 20.0
- Reverse Linked ListeasyLinked ListRecursionfrequency 20.0
- Rotate ImagemediumArrayMathMatrixfrequency 20.0
- Same TreeeasyTreeDepth-First SearchBreadth-First SearchBinary Treefrequency 20.0