Two Largest Values in Tree | Dataford Interview Questions

Find the maximum from a set of child nodes using a loop to track the two largest values.

Implement max_child_value(child_values), where child_values is a non-empty list of integers. Return the largest value, while tracking both the largest and second-largest values during one loop. For example, [4, 9, 2, 7] returns 9, and [-8, -3, -12] returns -3. Assume the list contains at least two values and may contain duplicates.

Constraints

2 <= len(child_values) <= 1000
-10^9 <= child_values[i] <= 10^9
Values may be duplicated

Function Signature

def max_child_value(child_values):

Your question is Two Largest Values in Tree. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem

Find the maximum from a set of child nodes using a loop to track the two largest values.

Constraints

2 <= len(child_values) <= 1000
-10^9 <= child_values[i] <= 10^9
Values may be duplicated

Function Signature

def max_child_value(child_values):

Your question is Two Largest Values in Tree. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.