Question d’entretien chez Clickr Media

find the longest substring without consecutive recurring characters