# Partition Array Into Disjoint Intervals Problem

## Description

LeetCode Problem 915.

Given an integer array nums, partition it into two (contiguous) subarrays left and right so that:

• Every element in left is less than or equal to every element in right.
• left and right are non-empty.
• left has the smallest possible size.

Return the length of left after such a partitioning.

Test cases are generated such that partitioning exists.

Example 1:

``````1
2
3
Input: nums = [5,0,3,8,6]
Output: 3
Explanation: left = [5,0,3], right = [8,6]
``````

Example 2:

``````1
2
3
Input: nums = [1,1,1,0,6,12]
Output: 4
Explanation: left = [1,1,1,0], right = [6,12]
``````

Constraints:

• 2 <= nums.length <= 10^5
• 0 <= nums[i] <= 10^6
• There is at least one valid answer for the given input.

## Sample C++ Code

``````1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
class Solution {
public:
int partitionDisjoint(vector<int>& a) {
int minNum = a, maxNum = a;
int index = 0;
for (int i = 1; i < a.size(); i++) {
if (a[i] < minNum) {
index = i;
minNum = maxNum;
}
maxNum = max(a[i], maxNum);
}
return index + 1;
}
};
``````