Your question is Longest Substring Without Repeats. Take a moment with it on the right.
Talk me through your thinking if you like. When you're confident, submit your answer and I'll grade it like a real screen (7/10 or better passes).
Explain how you would solve the problem of finding the longest substring in a string without repeating characters (for example, "ababcda" returns "abcd").