Clarify and Prune an N-ary Tree to a Depth Limit
Company: Snowflake
Role: Software Engineer
Category: Software Engineering Fundamentals
Difficulty: hard
Interview Round: Technical Screen
Overview: Clarify an ambiguous N-ary tree task involving maximum depth and minimum deletion under a depth limit. Compare distinct deletion-cost contracts, preserve a consistent depth convention, handle empty and root-only trees, and justify correctness and complexity without assuming one interpretation.
Read the full Snowflake Software Engineer interview experience this question came from