How should I practice Minimum Height?

Start by reading the full statement, solve the visible examples, then compare the pattern against related Snowflake online assessment problems in FastPrep.

Is Minimum Height associated with Snowflake?

FastPrep tags this as a Snowflake coding interview or online assessment practice problem when the problem catalog has that company context.

FastPrep

Problem · Tree

Minimum Height

● MediumSnowflakeOA

See Snowflake hiring insights

A database is represented as a rooted tree with tree_nodes tables, where Table 1 is the root.

Up to max_operations operations are allowed. In one operation:

Select a child table u of a parent table v and remove the edge between u and v.
Move u and its subtree to become a direct child of the root, reducing its depth.

Determine the minimum possible height of the tree.

Note:

The height of the tree is defined as the maximum depth of any table.
The depth of a table is the number of edges from the root to that table.
A subtree in a rooted tree is a subgraph of the tree consisting of a vertex, the root of that subtree, and its descendants, along with all edges incident to these descendants.

Function Description

Complete the function getMinimumHeight in the editor with the following parameters:

int tree_nodes: the number of nodes in the tree
int tree_from[tree_nodes - 1]: the starting node of the edge
int tree_to[tree_nodes - 1]: the ending node of the edge
int max_operations: the maximum number of operations

Returns

int: the minimum possible height of the tree after as many as max_operations operations

Examples

01 · Example 1

tree_nodes = 4
tree_from = [3, 1, 2]
tree_to = [2, 3, 4]
max_operations = 1
return = 2

1324

One possible operation can be:

Remove the edge (2, 4) and add an edge (1, 4).

4132

So, the height of the tree is 2.