SDE - 2

You are given an n-ary tree representing a network of transformers. Each node in the tree is a transformer with a specific integer voltage value.

The entire network is considered stable if and only if every transformer in the network adheres to a strict stability rule. The rule is as follows:

For any given transformer (node), the average voltage of all its descendants must be strictly less than the voltage of the transformer itself.

Your task is to determine if the given transformer network is stable.

You are given an array 'arr' of length 'n'. Find the index(0-based) of a peak element in the array. If there are multiple peak numbers, return the index of any peak number.

Peak element is defined as that element that is greater than both of its neighbors. If 'arr[i]' is the peak element, 'arr[i - 1]' < 'arr[i]' and 'arr[i + 1]' < 'arr[i]'.

Assume 'arr[-1]' and 'arr[n]' as negative infinity.

Note:

1.  There are no 2 adjacent elements having same value (as mentioned in the constraints).
2.  Do not print anything, just return the index of the peak element (0 - indexed).
3. 'True'/'False' will be printed depending on whether your answer is correct or not.

Example:

Input: 'arr' = [1, 8, 1, 5, 3]

Output: 3

Explanation: There are two possible answers. Both 8 and 5 are peak elements, so the correct answers are their positions, 1 and 3.

All the questions asked were behavioural. They inquired about my past work experiences and asked situational behavioural questions, such as when I last had to put in extra effort to deliver something to a customer. They also asked about my strengths and weaknesses, followed by a general discussion about the current team, the project, and my expected role and responsibilities.