Snowflake·Backend Engineer·Technical Phone Screen
Jun 2026
Snowflake backend interview that leaned heavily on graph algorithms. The core problem was topological sort but they kept pushing into follow-ups that honestly caught me more off guard than the main question did.
- Given a list of tasks with prerequisite dependencies, determine if all tasks can be completed without circular dependencies, and return a valid ordering if one exists.
- How would you modify the approach to find the minimum number of parallel batches (semesters) needed to complete all tasks?
- How would you produce the lexicographically smallest valid task ordering?
- Given a dependency graph that contains exactly one cycle, how would you identify the single edge whose removal makes the graph a valid DAG?
“Kahn's algorithm, compute in-degrees, queue up the zeros, drain it.”