Delete the Fewest Tree Nodes to Meet a Height Limit

Read the full interview experience this question came from →

Quick Overview

Find a minimum-cardinality set of tree-node deletions under child-promotion semantics using height-budget dynamic programming and explicit solution reconstruction.

Delete the Fewest Tree Nodes to Meet a Height Limit

Company: Snowflake

Role: Software Engineer

Category: Coding & Algorithms

Difficulty: medium

Interview Round: Technical Screen

Overview: Find a minimum-cardinality set of tree-node deletions under child-promotion semantics using height-budget dynamic programming and explicit solution reconstruction.

Read the full Snowflake Software Engineer interview experience this question came from

Snowflake logo
Snowflake
Sep 20, 2026
mediumSoftware EngineerTechnical ScreenCoding & Algorithms
29
0
Loading...