Longest substring without repeats
Slide a window along a string to find the longest stretch with no repeated character.
This problem is part of Premium
Interview-style problems with tests that check the tricky cases, to get you ready for coding interviews.