DFS to Find Longest Error Call Chain

CodingSnowflakeLast reported July 2025Low Frequency
Reported
1× across candidate reports
First seen
July 2025
Last reported
July 2025
Reported outcome
unknown

Problem Overview

This is the third part of a multi-part problem set. Given a directed graph representing service dependencies (provided as an adjacency list, where an edge from A to B means A calls B), and the initially crashed service (the source node), find the longest error propagation path starting…

  • 1 candidate-reported follow-up — the exact probes interviewers asked, with the trigger for each
  • The rest of the problem statement — full requirements, constraints, and edge cases
  • Approach and trade-offs — what passing candidates did, and the mistakes that sink people
Unlock the full Snowflake catalog
Full problem statements, candidate-reported follow-ups, and walkthroughs — for every Snowflake question.
Unlock with Pro
Already a member? Sign in
Verified Source
Every question is reconstructed from multiple independent candidate reports. Verbatim follow-ups, not invented ones.
Codex Fact-Checked
Technical claims, formulas, and scale numbers are reviewed against primary sources.
Interviewer Follow-ups
The exact follow-ups reported by candidates, with the trigger that prompts each one — plus the mistakes that sink people.
Is this helpful?