An array A consisting of N integers is given.
A pair of integers (P, Q), such that 0<P<Q<N, is called a slice of array A.
A slice is called bi-valued if it consists of at most two different numbers.
I need a function that, given an array, A consisting of N integers, returns the size of the largest bi-valued slice in A.