Snowflake Software Engineer Coding & Algorithms Interview Questions
Practice 46 real Coding & Algorithms interview questions for Software Engineer roles at Snowflake.
"I got asked a hardcore MCM DP question and I saw it on PracHub as well. Solved that question in 5 minutes. Without PracHub I doubt I could solve it in 5 hours. Though somehow didn't get hired, perhaps I guess I solved it too fast? /s"
"Believe me i'm a student here jn US. Recently interviewed for MSFT. They asked me exact question from PracHub. I saw it the night before and ignored it cause why waste time on random sites. I legit wanna go back and redo this whole thing if I had chance. Not saying will work for everyone but there is certainly some merit to that website. And i'm gonna use it in future prep from now on like lc tagged"
"10 years of experience but never worked at a top company. PracHub's senior-level questions helped me break into FAANG at 35. Age is just a number."
"I was skeptical about the 'real questions' claim, so I put it to the test. I searched for the exact question I got grilled on at my last Meta onsite... and it was right there. Word for word."
"Got a Google recruiter call on Monday, interview on Friday. Crammed PracHub for 4 days. Passed every round. This platform is a miracle worker."
"I've used LC, Glassdoor, and random Discords. Nothing comes close to the accuracy here. The questions are actually current — that's what got me. Felt like I had a cheat sheet during the interview."
"The solution quality is insane. It covers approach, edge cases, time complexity, follow-ups. Nothing else comes close."
"Legit the only resource you need. TC went from 180k -> 350k. Just memorize the top 50 for your target company and you're golden."
"PracHub Premium for one month cost me the price of two coffees a week. It landed me a $280K+ starting offer."
"Literally just signed a $600k offer. I only had 2 weeks to prep, so I focused entirely on the company-tagged lists here. If you're targeting L5+, don't overthink it."
"Coaches and bootcamp prep courses cost around $200-300 but PracHub Premium is actually less than a Netflix subscription. And it landed me a $178K offer."
"I honestly don't know how you guys gather so many real interview questions. It's almost scary. I walked into my Amazon loop and recognized 3 out of 4 problems from your database."
"Discovered PracHub 10 days before my interview. By day 5, I stopped being nervous. By interview day, I was actually excited to show what I knew."
"I recently cleared Uber interviews (strong hire in the design round) and all the questions were present in prachub."
"The search is what sold me. I typed in a really niche DP problem I got asked last year and it actually came up, full breakdown and everything. These guys are clearly updating it constantly."
Determine Whether an Undirected Graph Is 3-Colorable
Determine whether a possibly disconnected undirected graph with up to 20 vertices can be colored using at most three colors so that adjacent vertices ...
Answer Repeated Lookup Queries Efficiently
Implement batched lookups over a sorted integer array, returning the first index of each queried value while preserving query order. Account for dupli...
Find Shortest Wiki Click Path
Implement a function that computes the minimum number of clicks needed to navigate from one wiki page to another. You are given two page URIs, start_u...
Find the Nearest Target Character and Support Streaming Updates
Given an array of characters and a target character, return the distance from each index to the nearest target occurrence, or -1 if the target never a...
Solve Matrix and Array Distance Problems
This question evaluates competency in graph traversal and shortest-path reasoning for grid-based problems as well as array-based distance computation ...
Compute Inherited Role Privileges
You are given n roles. The array initialPrivileges has length n, where initialPrivileges[i] is the list of privileges directly assigned to role i. You...
Implement crawler and bracket validator
Implement two tasks: ( 1) Write a function crawl(start_urls, fetch, max_depth, domain_filter) that visits pages starting from the given seed URLs usin...
Design an in-memory filesystem and circular queue
Part A — Design an in-memory hierarchical file system. Requirements: - Support operations: ls(path), mkdir(path), createFile(path, content), appendToF...
Solve Array Distance and Wiki Navigation
You are given two independent coding tasks. For each task, clarify edge cases, implement the function, and write meaningful test cases. Task 1: Minimu...
Implement a JSON Parser
This question tests practical knowledge of parsing theory, including lexical analysis and recursive-descent parsing applied to a well-defined grammar....
Compute total time to finish all courses
This question evaluates competency in graph algorithms and scheduling, including dependency resolution, cycle detection, and aggregation of task durat...
Solve four OA algorithm problems
This multi-part exercise evaluates algorithmic problem-solving across combinatorics and geometry (counting axis-aligned square subgrids), string reord...
Compute height of tree with deleted nodes; minimize deletions
You are given a rooted tree (not necessarily binary). Each node has a list of children. Some nodes are marked as deleted = true. Define the effective ...
Solve scheduling and tree path problems
This set evaluates interval scheduling and constrained optimization for weighted, at-most-K selection, tree structure manipulation and subtree effects...
Compute task order and layered execution
You have N tasks labeled 0..N-1 and prerequisite pairs (a, b) meaning task a must complete before task b can start. Return any valid execution order o...
Solve three coding rounds
This multi-part question evaluates algorithmic problem-solving and practical implementation skills, covering grid geometry and distance metrics for ne...
Implement an in-memory file system
This question evaluates a candidate's ability to design and implement in-memory file system data structures and APIs, covering hierarchical directory ...
Design transactional in-memory key-value store
Problem Design and implement an in-memory key–value store that supports basic operations plus transactions. Core API Implement the following operation...
Compute nearest bathroom distance for each desk
You are given an m x n grid of characters containing only: - 'B' = bathroom - 'D' = desk - '_' = empty cell From any cell you may move one step up/dow...
Find first error and propagate failures
You are given a chronological log history where each entry is a string prefixed with one of [Info], [Warn], or [Error]. Two invariants hold: ( 1) once...