N-ary Tree Node Count via Distributed Message Passing

Phone ScreenSnowflakeLast reported July 2026Medium Frequency
Reported
7× across candidate reports
First seen
April 2025
Last reported
July 2026
Reported outcome
mixed

Problem Overview

You are given an N-ary tree where each node is an independent distributed process running on a different host. Nodes can only communicate with their direct parent and children via asynchronous message passing. You are provided with: (1) each node's unique ID, (2) each node's list of child IDs, (3)…

  • 3 candidate-reported follow-ups — 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?