Determining the maximum length of a substring without duplicate characters

Implement a function that takes a string and returns the length of the longest sequence of characters without repeats.

Example: Input: "abcabcbb" → Output: 3 Input: "bbbbbb" → Output: 1 Input: "pwwkew" → Output: 3