Snowflake interview questions

Snowflake coding and DSA questions

1. 01

   Remove Node from Forest

   A forest is represented as a list of integers, where each element stores the index of its parent node. Each node stores its parent’s index in the list. For a root node, the parent index is the node’s own index. For any node at index i, its parent index…

   From SnowFlake Interview Experience - Backend engineer Interview

2. 02

   Count Nodes in Distributed N-ary Tree

   You have an N-ary tree where each node runs as a separate process on a separate host and can only communicate via asynchronous message passing. Each node has a unique ID and a list of child node IDs. A sendAsync method is provided to dispatch messages, and a…

   From SnowFlake Interview Experience - Backend engineer Interview

3. 03

   Prime String Partition

   Given a numeric string, count the number of valid ways to split it into substrings where each substring represents a prime number. The solution typically uses dynamic programming to explore all possible partitions and check primality of each segment.

   From Snowflake OA Hackerrank 3 coding question

4. 04

   Text Scoring / Prefix Match Score

   Given two strings, compute a score based on prefix matches. The problem can be optimized using the Knuth-Morris-Pratt (KMP) algorithm or other prefix‑matching techniques to efficiently calculate the score for all possible prefixes.

   From Snowflake OA Hackerrank 3 coding question

5. 05

   Constrained Vowel Strings

   Count the number of strings of a given length that contain at most a certain number of consecutive vowel characters. This is a dynamic programming problem that tracks the number of consecutive vowels used so far.

   From Snowflake OA Hackerrank 3 coding question

6. 06

   Task Scheduling with Constraints

   Given a set of tasks with constraints (e.g., cooling periods or dependencies), schedule the tasks to minimize total execution time. The typical solution involves sorting the tasks and using a priority queue to select the next executable task.

   From Snowflake OA Hackerrank 3 coding question

7. 07

   String Rotation Check

   Determine if one string is a rotation of another. The classic solution checks whether the target string appears as a substring of the source string concatenated with itself (src + src).

   From Snowflake OA Hackerrank 3 coding question

8. 08

   Minimum Meeting Rooms Required

   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 determine whether all requests can be accommodated. If not,…

   Medium · From snowflake 26 intern vo experience

9. 09

   Find All Anagrams in a String

   Leetcode 438: Find all anagrams in a string.

   From Snowflake 2 Phone Screening Interviews

10. 10

    Word Search II

    Leetcode 212: Word Search II.

    From Snowflake 2 Phone Screening Interviews