You are given a bitonic array of integers nums of length n.

A bitonic array is an array that strictly increases to a single peak element and then strictly decreases. The peak element is included in both the ascending part and the descending part.

Find the peak element and calculate two sums:

• The sum of all elements in the ascending part from index $0$ to the peak element index inclusive.

• The sum of all elements in the descending part from the peak element index to index $n - 1$ inclusive.

Return:

• $0$ if the sum of the ascending part is strictly greater than the sum of the descending part.

• $1$ if the sum of the descending part is strictly greater than the sum of the ascending part.

• $-1$ if the sums of both parts are equal.

Constraints:

• $3 \leq n ==$ nums.length $\leq 10^5$

• $1 \leq$ nums[i] $\leq 10^9$

• nums is a bitonic array.

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.