Pergunta de entrevista da empresa Microsoft

One such question in Round 2 was: Longest substring without repeating characters. (Leetcode No. 3 - Meduim)