Domanda di colloquio di Manhattan Associates

Longest substring without repeating character, leetcode