Pregunta de entrevista de OpenX

longest substring without duplicate characters