leetcode

3. Longest Substring Without Repeating Characters

Solution code

Time complexity: O(n)

_k =

alphabet

= 128_

Space complexity: O(k)

Runtime 2 ms
Beats 98.92%

Memory 42.69 MB
Beats 98.00%