Question d’entretien chez Bloomberg

Leetcode number 5, longest substring without repeating character.