Find the longest substring without repeated characters
Return the maximum length of a contiguous substring with no repeated ASCII characters. Inputs are valid JSON and must not be modified unless the algorithm uses a local copy. This exercise probes typed data modeling, boundary handling, and algorithm selection.
Input
One JSON value: string. See the sample for its exact shape.
Output
One compact JSON value of type number. Strings include JSON quotes; arrays preserve the specified order.
Constraints
Array/string lengths are 0 to 10000 unless stated otherwise. Numbers are integers in [-1000000,1000000]; all computed results fit the safe integer range.
Example
Input
"abcabcbb"
Output
3
Example 2 input
"pwwkew"
Output
3
Checks a boundary or contrasting case beyond the public examples.
Public test cases (2)
Input
"abcabcbb"
Expected output
3
Input
"bbbbb"
Expected output
1
Hints (2)
- Start with the required output order and the empty-input behavior.
- Move the window start past the previous occurrence of each repeated character
Target complexity: time O(n) · space O(n)