Equal Mex Splitting

Chef has an array $A$ of length $N$. Chef wants to select some **disjoint, non-empty** subarrays from $A$ such that: - The $mex$ of each of the selected subarray is the same. Note that the selected subarrays **need not cover** all the elements of the array. For e.g. if $A = [2, 0, 1, 6, 2, 1, 3, 0, 7]$, then one way in which Chef can select subarrays is as following: ${[0, 1], [1, 3, 0]}$ (Here