Question d’entretien chez Manhattan Associates

Longest substring without repeating character, leetcode