Watch 10 video solutions for Partition Array into Disjoint Intervals, a medium level problem involving Array. This walkthrough by CrioDo has 304,611 views views. Want to try solving it yourself? Practice on FleetCode or read the detailed text solution.
Given an integer array nums, partition it into two (contiguous) subarrays left and right so that:
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:
Input: nums = [5,0,3,8,6] Output: 3 Explanation: left = [5,0,3], right = [8,6]
Example 2:
Input: nums = [1,1,1,0,6,12] Output: 4 Explanation: left = [1,1,1,0], right = [6,12]
Constraints:
2 <= nums.length <= 1050 <= nums[i] <= 106