3. Longest Substring Without Repeating Characters

Given a string s, find the length of the longest substring without repeating characters.

Word Count: 0