Pregunta de entrevista de Bloomberg

Leetcode number 5, longest substring without repeating character.