1p3a
Question
·
Dec 2025
Snowflake Intern Technical Interview Algorithm Tree Height Problem
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 all Snowflake questions
Full insider details, leaked discussions, and candidate experiences.
or every company, $100/year →About This Question
This is a reported interview question from a snowflake interview for a swe role (intern level) during the technical round reported in 2025.
It covers the following topics: Binary Tree, Graph, Greedy .
Topics
More Snowflake Interview Questions
Reddit
Snowflake screening interviews coming up — system design + coding questions?
Reddit
Tips Systems Role Snowflake
1p3a
snowflake hr screen interview experience for software engineer role
1p3a
Snowflake 2026 Software Engineer Intern VO Interview Experience
1p3a
Snowflake SWE AI/ML Intern Online Assessment Problems