Snowflake Online Assessment as a 90-minute HackerRank test with 3 coding questions, usually around Easy-Medium, Medium, and Medium-Hard difficulty. It says the main focus areas are dynamic programming, string processing, greedy algorithms, priority queues, and careful boundary-case handling. The article emphasizes that Snowflake OA questions often have long descriptions, strict edge cases, and high time pressure.

The high-frequency question types mentioned include Prime String Partition, which uses DP to count valid ways to split a numeric string into prime-number substrings; Text Scoring / Prefix Match Score, which can be optimized with KMP or prefix matching; Constrained Vowel Strings, a DP problem counting strings with limited consecutive vowels; Task Scheduling with Constraints, usually solved with sorting plus a priority queue; and String Rotation Check, where the classic trick is checking whether target appears in src + src.

For preparation, the article recommends focusing heavily on DP counting problems and state compression, practicing string algorithms like KMP, and doing full 90-minute HackerRank-style mock tests. It also suggests time allocation: finish the first problem in about 20 minutes, spend 25–30 minutes on the second, and leave enough time for the hardest third problem. Boundary cases such as empty strings, single characters, leading zeros, repeated characters, and overlap cases are highlighted as especially important.

More content can be referred to https://reurl.cc/18qGb8