leetcode

3. Longest Substring Without Repeating Characters

Solution

Time complexity: O(n)

_k = alphabet = 128_

Space complexity: O(k)