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

<ul>
	<li>Every element in <code>left</code> is less than or equal to every element in <code>right</code>.</li>
	<li><code>left</code> and <code>right</code> are non-empty.</li>
	<li><code>left</code> has the smallest possible size.</li>
</ul>

<p>Return <em>the length of </em><code>left</code><em> after such a partitioning</em>.</p>

<p>Test cases are generated such that partitioning exists.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> nums = [5,0,3,8,6]
<strong>Output:</strong> 3
<strong>Explanation:</strong> left = [5,0,3], right = [8,6]
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> nums = [1,1,1,0,6,12]
<strong>Output:</strong> 4
<strong>Explanation:</strong> left = [1,1,1,0], right = [6,12]
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>2 &lt;= nums.length &lt;= 10<sup>5</sup></code></li>
	<li><code>0 &lt;= nums[i] &lt;= 10<sup>6</sup></code></li>
	<li>There is at least one valid answer for the given input.</li>
</ul>

class Solution {
public:
    int partitionDisjoint(vector<int>& nums) {
        int n = nums.size();
        
        vector<int> maxl(n);
        for(int i=0; i<n; i++){
            if(i==0) maxl[i] = nums[i];
            else{
                maxl[i] = max(maxl[i-1], nums[i]);
            }
        }
        vector<int> minr(n);
        for(int i=n-1; i>=0; i--){
            if(i==n-1) minr[i] = nums[i];
            else{
                minr[i] = min(minr[i+1], nums[i]);
            }
        }

        for(int len = 1; len<n; len++){
            if(maxl[len-1] <= minr[len] ) return len;
        }
        
        return 0;

    }
};
105100