Question d’entretien chez Bloomberg

Giving a string return, the longest substring without repeating. I think this is a leetcode easy question