Snowflake

Snowflake Software Engineer Onsite Coding Questions

26+ questions from real Snowflake Software Engineer Onsite Coding rounds, reported by candidates who interviewed there.

26
Questions
8
Topic Areas
10+
Sources

What does the Snowflake Onsite Coding round test?

The Snowflake onsite coding round is the core technical evaluation. Software Engineer candidates typically see 2-3 algorithm and data structure problems. Problems range from medium to hard difficulty, and interviewers evaluate both correctness and code quality.

Top Topics in This Round

Snowflake Software Engineer Onsite Coding Questions

There is a list of meeting room usage requests, where each request is represented by an interval [start, end). At any given time, a meeting room can be occupied by only one request. The task is to det

Problem: Minimize Deletions to Target Tree Height **Inputs** * `root`: The root node of a binary tree. * `k`: An integer representing the target maximum height. **Definitions** * **Tree Height:**

#2742 Painting the Walls

Dynamic Programming

LeetCode #2742: Painting the Walls. Difficulty: Hard. Topics: Array, Dynamic Programming. Asked at Snowflake in the last 6 months.

LeetCode #202: Happy Number. Difficulty: Easy. Topics: Hash Table, Math, Two Pointers. Asked at Snowflake in the last 6 months.

LeetCode #1136: Parallel Courses. Difficulty: Medium. Topics: Graph Theory, Topological Sort. Asked at Snowflake in the last 6 months.

LeetCode #1242: Web Crawler Multithreaded. Difficulty: Medium. Topics: Depth-First Search, Breadth-First Search, Concurrency. Asked at Snowflake in the last 6 months.

LeetCode #1236: Web Crawler. Difficulty: Medium. Topics: String, Depth-First Search, Breadth-First Search, Interactive. Asked at Snowflake in the last 6 months.

#1494 Parallel Courses II

Dynamic Programming

LeetCode #1494: Parallel Courses II. Difficulty: Hard. Topics: Dynamic Programming, Bit Manipulation, Graph Theory, Bitmask. Asked at Snowflake in the last 6 months.

LeetCode #706: Design HashMap. Difficulty: Easy. Topics: Array, Hash Table, Linked List, Design, Hash Function. Asked at Snowflake in the last 6 months.

LeetCode #261: Graph Valid Tree. Difficulty: Medium. Topics: Depth-First Search, Breadth-First Search, Union-Find, Graph Theory. Asked at Snowflake in the last 6 months.

LeetCode #243: Shortest Word Distance. Difficulty: Easy. Topics: Array, String. Asked at Snowflake in the last 6 months.

LeetCode #23: Merge k Sorted Lists. Difficulty: Hard. Topics: Linked List, Divide and Conquer, Heap (Priority Queue), Merge Sort. Asked at Snowflake in the last 6 months.

LeetCode #849: Maximize Distance to Closest Person. Difficulty: Medium. Topics: Array. Asked at Snowflake in the last 6 months.

LeetCode #45: Jump Game II. Difficulty: Medium. Topics: Array, Dynamic Programming, Greedy. Asked at Snowflake in the last 6 months.

LeetCode #490: The Maze. Difficulty: Medium. Topics: Array, Depth-First Search, Breadth-First Search, Matrix. Asked at Snowflake in the last 6 months.

LeetCode #994: Rotting Oranges. Difficulty: Medium. Topics: Array, Breadth-First Search, Matrix. Asked at Snowflake in the last 6 months.

LeetCode #841: Keys and Rooms. Difficulty: Medium. Topics: Depth-First Search, Breadth-First Search, Graph Theory. Asked at Snowflake in the last 6 months.

#42 Trapping Rain Water

Dynamic Programming

LeetCode #42: Trapping Rain Water. Difficulty: Hard. Topics: Array, Two Pointers, Dynamic Programming, Stack, Monotonic Stack. Asked at Snowflake in the last 6 months.

LeetCode #1146: Snapshot Array. Difficulty: Medium. Topics: Array, Hash Table, Binary Search, Design. Asked at Snowflake in the last 6 months.

LeetCode #347: Top K Frequent Elements. Difficulty: Medium. Topics: Array, Hash Table, Divide and Conquer, Sorting, Heap (Priority Queue), Bucket Sort, Counting, Quickselect. Asked at Snowflake in the last 6 months.

See All 26 Questions from This Round

Full question text, answer context, and frequency data for subscribers.

Get Access