DSA Doctor
Verified Company Vault
30d Active
Snowflake DSA Interview Questions
99 curated coding interview questions directly asked in Snowflake technical rounds, sorted by frequency with recency and difficulty diagnostics.
99
Total Questions
13 (13%)
Easy Problems
66 (67%)
Medium Problems
20 (20%)
Hard Problems
🔥 Most Tested Topics:
Core DSA (30)Strings (17)Arrays (17)Trees (13)Design (10)
📂 Sourced Datasets:
Last 30 daysLast 3 monthsLast 6 monthsAll questionsOlder than 6 months
| ID | Problem | Difficulty | Topic | Pattern | Acceptance | Frequency | Recency |
|---|---|---|---|---|---|---|---|
| 2050 | Parallel Courses III | Hard | Graphs | BFS / DFS / Topological Sort | 66.8% | 100.0% | 30d |
| 1600 | Throne Inheritance | Medium | Core DSA | Implementation / Reasoning | 67.4% | 87.5% | 30d |
| 2062 | Count Vowel Substrings of a String | Easy | Strings; Trees | Hashing / Sliding Window; DFS / BFS | 73.2% | 87.5% | 30d |
| 3092 | Most Frequent IDs | Medium | Core DSA | Implementation / Reasoning | 42.8% | 87.5% | 30d |
| 588 | Design In-Memory File System | Hard | Design | Data Structure Design | 48.4% | 87.5% | 30d |
| 210 | Course Schedule II | Medium | Graphs | BFS / DFS / Topological Sort | 55.5% | 87.5% | 3m |
| 438 | Find All Anagrams in a String | Medium | Strings | Hashing / Sliding Window | 53.8% | 87.5% | 6m |
| 76 | Minimum Window Substring | Hard | Arrays; Strings; Trees | Sorting / Prefix / Scan; Hashing / Sliding Window; DFS / BFS; Sliding Window | 47.5% | 87.5% | all |
| 2742 | Painting the Walls | Hard | Core DSA | Implementation / Reasoning | 49.1% | 75.0% | 3m |
| 202 | Happy Number | Easy | Core DSA | Implementation / Reasoning | 59.7% | 75.0% | 3m |
| 243 | Shortest Word Distance | Easy | Strings | Hashing / Sliding Window | 66.3% | 75.0% | 3m |
| 695 | Max Area of Island | Medium | Graphs | BFS / DFS / Topological Sort | 74.0% | 75.0% | 3m |
| 641 | Design Circular Deque | Medium | Design | Data Structure Design | 64.7% | 75.0% | 3m |
| 1472 | Design Browser History | Medium | Design | Data Structure Design | 78.3% | 75.0% | 3m |
| 827 | Making A Large Island | Hard | Graphs | BFS / DFS / Topological Sort | 56.6% | 75.0% | 3m |
| 1353 | Maximum Number of Events That Can Be Attended | Medium | Arrays | Sorting / Prefix / Scan | 39.0% | 75.0% | 3m |
| 211 | Design Add and Search Words Data Structure | Medium | Strings; Binary Search; Design | Hashing / Sliding Window; Binary Search; Data Structure Design | 48.5% | 75.0% | 3m |
| 2096 | Step-By-Step Directions From a Binary Tree Node to Another | Medium | Trees | DFS / BFS | 56.4% | 75.0% | 3m |
| 71 | Simplify Path | Medium | Core DSA | Implementation / Reasoning | 50.6% | 75.0% | 3m |
| 1236 | Web Crawler | Medium | Core DSA | Implementation / Reasoning | 68.8% | 75.0% | 6m |
| 1136 | Parallel Courses | Medium | Graphs | BFS / DFS / Topological Sort | 62.2% | 75.0% | 6m |
| 706 | Design HashMap | Easy | Design | Data Structure Design | 66.6% | 75.0% | 6m |
| 1235 | Maximum Profit in Job Scheduling | Hard | Arrays | Sorting / Prefix / Scan | 54.7% | 75.0% | 6m |
| 545 | Boundary of Binary Tree | Medium | Trees | DFS / BFS | 48.1% | 75.0% | 6m |
| 261 | Graph Valid Tree | Medium | Strings; Trees; Graphs | Hashing / Sliding Window; DFS / BFS; BFS / DFS / Topological Sort | 50.0% | 75.0% | 6m |
| 347 | Top K Frequent Elements | Medium | Heap | Priority Queue | 66.4% | 75.0% | 6m |
| 2856 | Minimum Array Length After Pair Removals | Medium | Arrays | Sorting / Prefix / Scan | 27.5% | 75.0% | all |
| 1639 | Number of Ways to Form a Target String Given a Dictionary | Hard | Strings | Hashing / Sliding Window | 56.5% | 75.0% | all |
| 2303 | Calculate Amount Paid in Taxes | Easy | Core DSA | Implementation / Reasoning | 69.3% | 75.0% | all |
| 3177 | Find the Maximum Length of a Good Subsequence II | Hard | Arrays | Sorting / Prefix / Scan | 25.2% | 75.0% | all |
| 3176 | Find the Maximum Length of a Good Subsequence I | Medium | Arrays | Sorting / Prefix / Scan | 32.8% | 75.0% | all |
| 3155 | Maximum Number of Upgradable Servers | Medium | Arrays | Sorting / Prefix / Scan | 43.5% | 75.0% | all |
| 2851 | String Transformation | Hard | Strings | Hashing / Sliding Window | 27.2% | 75.0% | all |
| 23 | Merge k Sorted Lists | Hard | Arrays; Linked List; Heap | Sorting / Prefix / Scan; Two Pointers; Priority Queue | 59.6% | 75.0% | all |
| 1242 | Web Crawler Multithreaded | Medium | Core DSA | Implementation / Reasoning | 51.2% | 62.5% | 6m |
| 45 | Jump Game II | Medium | Greedy | Greedy | 42.9% | 62.5% | 6m |
| 841 | Keys and Rooms | Medium | Core DSA | Implementation / Reasoning | 75.8% | 62.5% | 6m |
| 42 | Trapping Rain Water | Hard | Core DSA | Two Pointers | 67.4% | 62.5% | 6m |
| 1146 | Snapshot Array | Medium | Arrays | Sorting / Prefix / Scan | 36.8% | 62.5% | 6m |
| 212 | Word Search II | Hard | Strings; Binary Search | Hashing / Sliding Window; Binary Search | 38.5% | 62.5% | 6m |
| 207 | Course Schedule | Medium | Graphs | BFS / DFS / Topological Sort | 51.4% | 62.5% | 6m |
| 146 | LRU Cache | Medium | Design | Data Structure Design | 47.4% | 62.5% | 6m |
| 21 | Merge Two Sorted Lists | Easy | Arrays; Linked List | Sorting / Prefix / Scan; Two Pointers | 68.3% | 62.5% | all |
| 981 | Time Based Key-Value Store | Medium | Core DSA | Implementation / Reasoning | 49.9% | 62.5% | all |
| 224 | Basic Calculator | Hard | Stack / Queue | Monotonic Stack / Simulation | 46.9% | 62.5% | all |
| 362 | Design Hit Counter | Medium | Design | Data Structure Design | 69.7% | 62.5% | all |
| 621 | Task Scheduler | Medium | Greedy | Greedy | 63.1% | 62.5% | all |
| 138 | Copy List with Random Pointer | Medium | Linked List | Two Pointers | 62.9% | 62.5% | all |
| 849 | Maximize Distance to Closest Person | Medium | Core DSA | Implementation / Reasoning | 49.8% | 62.5% | all |
| 1 | Two Sum | Easy | Arrays | Sorting / Prefix / Scan; Two Pointers | 57.5% | 62.5% | all |
| 1233 | Remove Sub-Folders from the Filesystem | Medium | Core DSA | Implementation / Reasoning | 78.6% | 62.5% | all |
| 3880 | Minimum Absolute Difference Between Two Values | Easy | Arrays | Sorting / Prefix / Scan | 66.5% | 62.5% | all |
| 10 | Regular Expression Matching | Hard | Core DSA | Implementation / Reasoning | 31.0% | 50.0% | all |
| 116 | Populating Next Right Pointers in Each Node | Medium | Trees | DFS / BFS | 67.2% | 50.0% | all |
| 273 | Integer to English Words | Hard | Strings | Hashing / Sliding Window | 35.0% | 50.0% | all |
| 787 | Cheapest Flights Within K Stops | Medium | Heap | Priority Queue | 41.8% | 50.0% | all |
| 380 | Insert Delete GetRandom O(1) | Medium | Core DSA | Implementation / Reasoning | 55.4% | 50.0% | all |
| 2265 | Count Nodes Equal to Average of Subtree | Medium | Trees | DFS / BFS | 86.8% | 50.0% | all |
| 872 | Leaf-Similar Trees | Easy | Trees | DFS / BFS | 70.2% | 50.0% | all |
| 155 | Min Stack | Medium | Stack / Queue | Monotonic Stack / Simulation | 58.2% | 50.0% | all |
| 528 | Random Pick with Weight | Medium | Core DSA | Implementation / Reasoning | 49.1% | 50.0% | all |
| 295 | Find Median from Data Stream | Hard | Heap | Priority Queue | 54.5% | 50.0% | all |
| 52 | N-Queens II | Hard | Backtracking | Backtracking | 78.7% | 50.0% | all |
| 687 | Longest Univalue Path | Medium | Core DSA | Implementation / Reasoning | 43.9% | 50.0% | all |
| 540 | Single Element in a Sorted Array | Medium | Arrays | Sorting / Prefix / Scan | 59.3% | 50.0% | all |
| 13 | Roman to Integer | Easy | Strings | Hashing / Sliding Window | 66.6% | 50.0% | all |
| 917 | Reverse Only Letters | Easy | Strings | Hashing / Sliding Window | 68.5% | 50.0% | all |
| 947 | Most Stones Removed with Same Row or Column | Medium | Core DSA | Implementation / Reasoning | 62.9% | 50.0% | all |
| 1751 | Maximum Number of Events That Can Be Attended II | Hard | Arrays | Sorting / Prefix / Scan | 63.5% | 50.0% | all |
| 635 | Design Log Storage System | Medium | Design | Data Structure Design | 59.6% | 50.0% | all |
| 994 | Rotting Oranges | Medium | Core DSA | Implementation / Reasoning | 58.7% | 50.0% | all |
| 1494 | Parallel Courses II | Hard | Graphs | BFS / DFS / Topological Sort | 31.0% | 50.0% | all |
| 117 | Populating Next Right Pointers in Each Node II | Medium | Trees | DFS / BFS | 57.6% | 37.5% | all |
| 227 | Basic Calculator II | Medium | Stack / Queue | Monotonic Stack / Simulation | 46.9% | 37.5% | all |
| 253 | Meeting Rooms II | Medium | Greedy | Greedy | 52.7% | 37.5% | all |
| 271 | Encode and Decode Strings | Medium | Strings; Dynamic Programming; Stack / Queue | Hashing / Sliding Window; State Transition; Monotonic Stack / Simulation | 51.6% | 37.5% | all |
| 1898 | Maximum Number of Removable Characters | Medium | Arrays; Strings | Sorting / Prefix / Scan; Hashing / Sliding Window | 47.2% | 37.5% | all |
| 11 | Container With Most Water | Medium | Core DSA | Two Pointers | 60.0% | 37.5% | all |
| 139 | Word Break | Medium | Strings; Dynamic Programming | Hashing / Sliding Window; State Transition | 49.5% | 37.5% | all |
| 105 | Construct Binary Tree from Preorder and Inorder Traversal | Medium | Trees | DFS / BFS | 68.8% | 37.5% | all |
| 2467 | Most Profitable Path in a Tree | Medium | Trees | DFS / BFS | 67.3% | 37.5% | all |
| 408 | Valid Word Abbreviation | Easy | Strings | Hashing / Sliding Window | 37.0% | 37.5% | all |
| 208 | Implement Trie (Prefix Tree) | Medium | Trees | DFS / BFS | 69.5% | 37.5% | all |
| 286 | Walls and Gates | Medium | Core DSA | Implementation / Reasoning | 64.0% | 37.5% | all |
| 1631 | Path With Minimum Effort | Medium | Arrays | Sorting / Prefix / Scan | 63.2% | 37.5% | all |
| 402 | Remove K Digits | Medium | Core DSA | Implementation / Reasoning | 36.9% | 37.5% | all |
| 121 | Best Time to Buy and Sell Stock | Easy | Core DSA | Implementation / Reasoning | 56.8% | 37.5% | all |
| 435 | Non-overlapping Intervals | Medium | Arrays; Greedy | Sorting / Prefix / Scan; Greedy | 57.1% | 37.5% | all |
| 881 | Boats to Save People | Medium | Core DSA | Implementation / Reasoning | 61.8% | 37.5% | all |
| 79 | Word Search | Medium | Strings; Binary Search | Hashing / Sliding Window; Binary Search | 47.4% | 37.5% | all |
| 729 | My Calendar I | Medium | Core DSA | Implementation / Reasoning | 58.3% | 37.5% | all |
| 1604 | Alert Using Same Key-Card Three or More Times in a One Hour Period | Medium | Core DSA | Implementation / Reasoning | 46.3% | 37.5% | all |
| 622 | Design Circular Queue | Medium | Stack / Queue; Design | Monotonic Stack / Simulation; Data Structure Design | 54.7% | 37.5% | all |
| 1166 | Design File System | Medium | Design | Data Structure Design | 65.1% | 37.5% | all |
| 276 | Paint Fence | Medium | Core DSA | Implementation / Reasoning | 48.4% | 37.5% | all |
| 2 | Add Two Numbers | Medium | Core DSA | Implementation / Reasoning | 48.5% | 37.5% | all |
| 490 | The Maze | Medium | Core DSA | Implementation / Reasoning | 60.4% | 37.5% | all |
| 1057 | Campus Bikes | Medium | Core DSA | Implementation / Reasoning | 59.1% | 37.5% | all |
| 2458 | Height of Binary Tree After Subtree Removal Queries | Hard | Trees | DFS / BFS | 54.9% | 37.5% | all |