Reason about string windows
Find the longest substring without repeating characters. Walk through a repeated character, an empty input, and a string with all unique characters.
What a strong answer demonstrates
Correct window updates, explicit character assumptions, and linear-time reasoning.