3698. Split Array With Minimum Difference

LeetCodeArrayPrefix SumOpen on judge ↗

You are given an integer array nums. Split the array into exactly two subarrays, left and right, such that left is strictly increasing and right is strictly decreasing. Return the minimum possible absolute difference between the sums of left and right. If no valid split exists, return -1. Example 1: Input: nums = [1,3,2] Output: 2 Explanation: i left right Validity left sum right sum Ab

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