Snowflake Interview Questions — 90 DSA Problems

78 problems with full solutions in Python, Java, C++, JavaScript, Go, Rust.

Most frequently asked Snowflake LeetCode questions for software engineering interviews.

• Design In-Memory File System (HARD) — Hash Table, String, Design, Trie, Sorting
• Happy Number (EASY) — Hash Table, Math, Two Pointers
• Minimum Window Substring (HARD) — Hash Table, String, Sliding Window
• Course Schedule II (MEDIUM) — Depth-First Search, Breadth-First Search, Graph, Topological Sort
• Find All Anagrams in a String (MEDIUM) — Hash Table, String, Sliding Window
• Word Search II (HARD) — Array, String, Backtracking, Trie, Matrix
• String Transformation (HARD) — Math, String, Dynamic Programming, String Matching
• Step-By-Step Directions From a Binary Tree Node to Another (MEDIUM) — String, Tree, Depth-First Search, Binary Tree
• Calculate Amount Paid in Taxes (EASY) — Array, Simulation
• Maximum Number of Upgradable Servers (MEDIUM) — Array, Math, Binary Search
• Trapping Rain Water (HARD) — Array, Two Pointers, Dynamic Programming, Stack, Monotonic Stack
• Maximum Profit in Job Scheduling (HARD) — Array, Binary Search, Dynamic Programming, Sorting
• Painting the Walls (HARD) — Array, Dynamic Programming
• Minimum Array Length After Pair Removals (MEDIUM) — Array, Hash Table, Two Pointers, Binary Search, Greedy, Counting
• Number of Ways to Form a Target String Given a Dictionary (HARD) — Array, String, Dynamic Programming
• Find the Maximum Length of a Good Subsequence I (MEDIUM) — Array, Hash Table, Dynamic Programming
• Parallel Courses III (HARD) — Array, Dynamic Programming, Graph, Topological Sort
• Find the Maximum Length of a Good Subsequence II (HARD) — Array, Hash Table, Dynamic Programming
• Basic Calculator (HARD) — Math, String, Stack, Recursion
• Regular Expression Matching (HARD) — String, Dynamic Programming, Recursion
• Throne Inheritance (MEDIUM) — Hash Table, Tree, Depth-First Search, Design
• Count Vowel Substrings of a String (EASY) — Hash Table, String
• Boundary of Binary Tree (MEDIUM) — Tree, Depth-First Search, Binary Tree
• Design Hit Counter (MEDIUM) — Array, Binary Search, Design, Queue, Data Stream
• Reverse Nodes in k-Group (HARD) — Linked List, Recursion
• Time Based Key-Value Store (MEDIUM) — Hash Table, String, Binary Search, Design
• Two Sum (EASY) — Array, Hash Table
• Populating Next Right Pointers in Each Node II (MEDIUM) — Linked List, Tree, Depth-First Search, Breadth-First Search, Binary Tree
• Merge Two Sorted Lists (EASY) — Linked List, Recursion
• Max Area of Island (MEDIUM) — Array, Depth-First Search, Breadth-First Search, Union Find, Matrix
• Populating Next Right Pointers in Each Node (MEDIUM) — Linked List, Tree, Depth-First Search, Breadth-First Search, Binary Tree
• Copy List with Random Pointer (MEDIUM) — Hash Table, Linked List
• Encode and Decode Strings (MEDIUM) — Array, String, Design
• Task Scheduler (MEDIUM) — Array, Hash Table, Greedy, Sorting, Heap (Priority Queue), Counting
• Course Schedule (MEDIUM) — Depth-First Search, Breadth-First Search, Graph, Topological Sort
• Design HashMap (EASY) — Array, Hash Table, Linked List, Design, Hash Function
• Sliding Window Median (HARD) — Array, Hash Table, Sliding Window, Heap (Priority Queue)
• LRU Cache (MEDIUM) — Hash Table, Linked List, Design, Doubly-Linked List
• Merge k Sorted Lists (HARD) — Linked List, Divide and Conquer, Heap (Priority Queue), Merge Sort
• Min Stack (MEDIUM) — Stack, Design
• Basic Calculator II (MEDIUM) — Math, String, Stack
• Swap Nodes in Pairs (MEDIUM) — Linked List, Recursion
• Integer to English Words (HARD) — Math, String, Recursion
• Patching Array (HARD) — Array, Greedy
• Graph Valid Tree (MEDIUM) — Depth-First Search, Breadth-First Search, Union Find, Graph
• Count Subarrays With Fixed Bounds (HARD) — Array, Queue, Sliding Window, Monotonic Queue
• Random Pick with Weight (MEDIUM) — Array, Math, Binary Search, Prefix Sum, Randomized
• Implement Trie (Prefix Tree) (MEDIUM) — Hash Table, String, Design, Trie
• Longest Univalue Path (MEDIUM) — Tree, Depth-First Search, Binary Tree
• Maximize Distance to Closest Person (MEDIUM) — Array