Available question text
Partition the array into two non-empty contiguous subarrays left and right so that every element in left <= every element in right, and left has the smallest possible size; return the length of left. Equivalently, find the smallest index i such that max(nums[0..i]) <= min(nums[i+1..n-1]).
Related questions
Continue with questions that share topics or the same question type.
- Partition Array Into K-Distinct Groups
Coding
- Partition Array Into Three Parts With Equal Sum
Coding
- Partition Array Into Two Arrays to Minimize Sum Difference
Coding · Array · Binary Search · Bit Manipulation
- Partition Array into Two Equal Product Subsets
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 915. Partition Array into Disjoint Intervals
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source