Bloomberg interview question

Leetcode number 5, longest substring without repeating character.