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

Snowflake phone-screen question, reconstructed from 7 candidate reports (April 2025 to July 2026). Tests: tree recursion and traversal; concurrency and thread safety. Candidates reported 3 follow-ups. The write-up includes a Python solution that passes 11 test cases.

3 candidate-reported follow-ups — the probes candidates report being asked, with the trigger for each
The full 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. Follow-ups candidates reported, not invented ones.

Codex Fact-Checked

Technical claims, formulas, and scale numbers are reviewed against primary sources.

Interviewer Follow-ups

The follow-ups candidates reported, with the trigger that prompts each one — plus the mistakes that sink people.