Leetcode 915. Partition Array into Disjoint Intervals

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]).

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 915. Partition Array into Disjoint Intervals

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact