The process consisted of an initial online assessment with coding challenges on data structures and algorithms, followed by a technical interview.

During the technical round, I was asked to solve problems in real-time while explaining my thought process.

What was a bit disheartening was the interviewer not engaging in the interview process. They gave a question, muted their mic, and were not responding.

You are given a tree with n nodes and n-1 edges. Each node has a price associated with it.

The tree can be rooted at any node, and the "cost" of a root is defined as the difference between the highest and lowest price sums of all paths starting from that root.

Given the tree structure and the price array, return the maximum possible cost across all possible root choices.