can anyone explain me this question
k: number of available flavours (At Least 2 flavours should be there; 2<= k <= 10^5).
And a list of food(N no.s) denoted by their flavours (k) ;
U need to find::
a contiguous list of food, of maximum length, missing at least one flavour.
return it’s length.
Hope it helps!.
Formal description and solution : NOTALLFL