Snowflake·Backend Engineer·Technical Phone Screen
Jun 2026
Snowflake backend interview centered almost entirely on graph problems. The core question was a topological sort variant and they kept pushing with follow-ups that got progressively trickier. Not a bad experience but I definitely underestimated how deep they'd go on a single topic.
- Given a list of tasks labeled 0 to n-1 and prerequisite pairs indicating dependencies, can all tasks be completed without a cyclic dependency? If yes, produce a valid ordering.
- What is the minimum number of parallel batches (or semesters) needed to complete all tasks, assuming tasks with no remaining dependencies can run simultaneously?
- How would you modify the approach to return the lexicographically smallest valid ordering?
- Given a directed graph that contains exactly one cycle, how would you find the single edge whose removal makes the graph a valid DAG?
“Classic topological sort.”