1p3a Question · Dec 2025

Snowflake Intern Technical Interview Algorithm Tree Height Problem

SWE Technical Intern

Question Details

Got this problem in Snowflake interview: Given a graph of `height >= k` rooted at `node = 0`, return the minimum set of nodes to delete (not count) such that the resulting tree has height of at most `

Full Details

🔒

Unlock full leaked content

Full insider details, leaked discussions, and candidate experiences.

Get Premium →

Topics

Trees Graphs