Given a string s, return the length of the longest substring that contains no repeating characters.
A substring is a contiguous sequence of characters within the string.
This is the classic sliding window problem. Real-world uses: stream deduplication, session token validation, and compression algorithms.