3909. Compare Sums of Bitonic Parts

LeetCodeArrayOpen on judge ↗

You are given a bitonic array nums of length n. Split the array into two parts: - Ascending part: from index 0 to the peak element (inclusive). - Descending part: from the peak element to index n - 1 (inclusive). The peak element belongs to both parts. Return: - 0 if the sum of the ascending part is greater. - 1 if the sum of the descending part is greater. - -1 if both sums are equal. No

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI