Removing starting elements of current subarray while there is an element in set which makes a pair with mod [ i ] such that the pair sum is divisible .
while ( $ mp [ $ k - $ mod ] != 0 || ( $ mod == 0 && $ mp [ $ mod ] != 0 ) ) { $ mp [ $ arr [ $ s ] % $ k ] -- ; $ s ++ ; }