JuniorJunior (1–3 yrs)CodingPythonAmazonMicrosoftAdobe
Longest substring without repeating
Find the length of the longest substring without repeating characters.
Answers use simple, clear English.
Time: O(n)Space: O(min(n, alphabet))
Confidence
juniormidsenior#sliding-window#string#blind75