K-Partition

Alice has an array of $N$ integers $A_1, A_2, A_3........,A_{N-1} ,A_N$ such that for each $i$, $1 \leq A_i \leq N$. A partition in an array is any contiguous subarray. For an integer $k$ , Alice wants to partition the given array in minimum possible partitions such that the number of distinct integers in each partition is $\leq k$. That is she want to divide the array in minimum number of parts