Question d’entretien chez Google

Given a string, find the longest substring without repeating characters."