Domanda di colloquio di Bloomberg

Leetcode number 5, longest substring without repeating character.