Longest Substring without Repeating Characters

Statement

Given a string, str, return the length of the longest substring without repeating characters.

Constraints:

• $1$ $\leq$ str.length $\leq 10^5$
• str consists of English letters, digits, and spaces.

Examples