Tree Max Height After Node Deletion

Phone ScreenSnowflakeLast reported September 2026High Frequency
Reported
11× across candidate reports
First seen
March 2025
Last reported
September 2026
Reported outcome
mixed

Problem Overview

You are given an n-ary tree (not necessarily binary) and a list of node IDs to delete. When a node is deleted, it is removed from the tree but its children are NOT deleted — instead, all of its children are promoted and become direct children of the deleted node's…

  • 5 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?